the unexpected question was "is the vector consecutive". I thought it wasn't as if it were consecutive then we would be able to use pointer arithmetic to iterate through the vector but i haven't seen that. I then was told it was actually consecutive. Just think about how vector is implemented and you won't miss it. The phone interview is easier than I expected. Nothing too difficult and the interviewer is quite nice.
Remove consecutive duplicates in a string inplace and less than O(n)
nothing particularly hard.
An interesting problem involving roman numerals.
where is static variables stored
For the campus map/direction app: I focused on the algorithms that would create paths from one location on campus to another, because I know a lot about path algorithms. Talked about dividing a map into grid squares to using A* and BFS to find optimal paths. Also talked about the issues with using too large of a grid square size and too small, and guessed that a good size would be approximately the size of space that a person takes standing up.
If given an integer 123, how do you reverse it to 321
Nothing unexpected or difficult.
What is a virtual pointer
Fortunately interviewer called me third time . All the questions were about data structure and interview lasted for approx 50 minutes. All the questions were from career cup .
Viewing 801 - 810 interview questions