Skip to contentSkip to footer

Graduate Developer Interview Questions

Salaries
Interviews

7,754 graduate developer interview questions shared by candidates

The first half is largely pattern recognition (e.g. something like 'guess the next number: 1, 4, 4, 7, 28, 10, 280, 13' except more complicated). The second half is more just rapid fire calculations, "calculate how much interest is paid on this load in x years" type stuff. There's enough time to do them out by hand but unless there are two very similar options, you're best off estimating which choice is best
avatar

Graduate Software Developer

Interviewed at IBM

3.9★
May 30, 2017

The first half is largely pattern recognition (e.g. something like 'guess the next number: 1, 4, 4, 7, 28, 10, 280, 13' except more complicated). The second half is more just rapid fire calculations, "calculate how much interest is paid on this load in x years" type stuff. There's enough time to do them out by hand but unless there are two very similar options, you're best off estimating which choice is best

The second question was a bit confusing. Suppose you have a facebook API, which allows you to access all one's friends. Can you find if B is connect to A through friend's network? say A has friends (C,D,E) and C has friends(B,G). Now A is connected to B. I did the second one with a 7 layer for loop first, 'cause I was avoiding overloading the memory with too much data. However, the interviewer seems not to appreciate that. But I did answer the following up question wrong. He asked what is the big O for my code. A map search is N(nodes)+V(edge). I did not know that, I gave a answer of N, which is close but not correct.
avatar

Software Engineer New Graduate

Interviewed at Google

4.4★
Apr 4, 2016

The second question was a bit confusing. Suppose you have a facebook API, which allows you to access all one's friends. Can you find if B is connect to A through friend's network? say A has friends (C,D,E) and C has friends(B,G). Now A is connected to B. I did the second one with a 7 layer for loop first, 'cause I was avoiding overloading the memory with too much data. However, the interviewer seems not to appreciate that. But I did answer the following up question wrong. He asked what is the big O for my code. A map search is N(nodes)+V(edge). I did not know that, I gave a answer of N, which is close but not correct.

Viewing 6921 - 6930 interview questions

Glassdoor has 7,754 interview questions and reports from Graduate developer interviews. Prepare for your interview. Get hired. Love your job.