Skip to contentSkip to footer

Software Engineer Interview Questions

Salaries
Interviews

467,266 software engineer interview questions shared by candidates

Question was not difficult. In fact they asked the same queston from almost every interviewee. Qeustion: Given a number N and an array Arr[], search find two numbers which sum up to number N. When you will suggest binary search for this problem. They will ask about the complexity difference between two nested loop and binary search solution. After discussion of algorithm/solution, they will ask you to write down the code on paper. Both interviewers look like of Chinese origin. Only manager got involved in discussion and asked questions. The other one stayed silent. He sounds shy and asocial but was not pyschologist for sure. Maybe he was hired based on his extra-ordinary technical skills or strong internal (possibly Chinese) connection. The whole interviewed lasted for an hour.
avatar

Software Developer

Interviewed at IBM

3.9★
Sep 25, 2012

Question was not difficult. In fact they asked the same queston from almost every interviewee. Qeustion: Given a number N and an array Arr[], search find two numbers which sum up to number N. When you will suggest binary search for this problem. They will ask about the complexity difference between two nested loop and binary search solution. After discussion of algorithm/solution, they will ask you to write down the code on paper. Both interviewers look like of Chinese origin. Only manager got involved in discussion and asked questions. The other one stayed silent. He sounds shy and asocial but was not pyschologist for sure. Maybe he was hired based on his extra-ordinary technical skills or strong internal (possibly Chinese) connection. The whole interviewed lasted for an hour.

If V is a vector with n items and subroutine Exchange swaps its arguments, then the following code fragment sorts V in descending order. for( j = 0; j < n - 1; j++ ) for( k = 0; k < n - j - 1; k++ ) if( V[k] < V[k+1] ) Exchange( V[k], V[k+1] ); How many calls to Exchange are made if initially, V[i]=i, for i = 0, 1, 2, ..., n - 1 ? a. n-1 b. n c. n(n-1)/2 d. (n-1)(n-2) e. n(n-1)
avatar

Software Engineer

Interviewed at Everpure

3.5★
Apr 30, 2011

If V is a vector with n items and subroutine Exchange swaps its arguments, then the following code fragment sorts V in descending order. for( j = 0; j < n - 1; j++ ) for( k = 0; k < n - j - 1; k++ ) if( V[k] < V[k+1] ) Exchange( V[k], V[k+1] ); How many calls to Exchange are made if initially, V[i]=i, for i = 0, 1, 2, ..., n - 1 ? a. n-1 b. n c. n(n-1)/2 d. (n-1)(n-2) e. n(n-1)

Viewing 1841 - 1850 interview questions

Glassdoor has 467,266 interview questions and reports from Software engineer interviews. Prepare for your interview. Get hired. Love your job.