Time: One hour-long.
No of Questions: Two coding questions of 100 marks each.
Difficulty: The level of the questions was moderate.
There were two rounds of interviews:
1. It was based on Permutation and Combination.
2. Median of running stream.
3. Variation of knapsack DP problem.
He also asked me to explain Virtual Memory and does it implemented.
1.Longest Palindromic Substring.
2.Check if an array is wave array. The question was further extended and I was asked to convert an array into a wave array.
3.Find the kth smallest element from a stream of numbers.
He also asked me various page replacement algorithms in OS.
No HR round was taken.