The interview lasts for about half an hour. In the beginning I gave an elevated pitch on my experience. Then there came eight technical questions. \nHere are the questions:\n\t- What\'s best/ worst running time for Merge Sort? \n\t- What\'s average / worst running time for Quick Sort?\n\t- What\'s the worst running time for a look up in a Hashtable?\n\t- Could you name an implementation of Hashtable?\n\t- Which of the following Python data structure is not mutable: tuple, list, dictionary?\n\t- For an unweighted graph, which algorithm should be used to find shortest path: breath first search or Diajkstra?\n\t- Could you estimate 2^24?\n\t- In Java, could you name two Map implementations?\n\nI made 6 out of 8 correct and was able to go to next level of coding interview. Then I was given a feedback on my basic data stucuture and algorithm knowledge, and was advised on how to prepared for the next level.\n

The interview lasts for about half an hour. In the beginning I gave an elevated pitch on my experience. Then there came eight technical questions. \nHere are th