Find the sum of an array. There were also a couple of other easy array questions such as getting the middle, or searching for some other properties. Be sure to study array basic algorithms. That was all that there was to the entire interview. Other questions included behavioral questions such as tell me about yourself.
In the technical round, two coding questions were asked: the easier was a simple merging of arrays problem and the next one involved a priority queue.
How to find the distance between 2 points.
Describe a situation in which you had to learn something new to solve a problem
Prefix Sums Graph DFS Traffic simulation - Low Level System Design
Difference between older and latest version of C++.
What concepts you don't like about Java? and why?
What were the classes in your program that you preferred.
I did not expect the interviewer would ask some DP question during phone interview stage and the collabedit is horrible.
The question was to fin the number of time an array was schifted. For example: [1 2 3 4 5 ] is 0 because it is in order [7 5 6] is 1 because it should be [5 6 7] [7 8 9 2] is 1 too.
Viewing 1091 - 1100 interview questions