There are a lot of questions that can be solved by arrays, sorting can be done in O(nlogn)... but they are looking for more than just correct answers, having an answer with a high time / space complexity won't help you. There was a tough question about linked lists with next and arbitrary pointers.
What's the difference between the stack and heap when they are initialized.
The technical problem wasn't something very difficult at first sight, but the trick was finding out the most efficient solution, which involved using tries. This solution was not implementable in 45 minutes, so the interviewer asked me to implement a specific part from the solution. There were very few behavioural questions, and nothing unexpected.
-Write a method to convert an integer into a roman numeral string -Design a class for a deck of cards
Debug some pieces of code.
Find the smallest entry in matrix with given boundary
they were simple coding questions, you can use any language for the interview
String manipulation and binary search tree
Tell me about a time you took a calculated risk
What role did you play on the team during your past internship?
Viewing 5341 - 5350 interview questions