Question: Designed an efficient key-value data structure, each element has an elapsed time. For example, elements A with elapsed time 15 (keyA , (valueA , 15)) will be removed from the data structure after 15 seconds from the time it was added to the data structure
Quite difficult binary tree problems in both rounds.
How many hours do you code during a day?
Prove P = NP
Arrays,Trees,Strings concepts
Two very easy coding questions.
back to back technical questions. Two medium to hard coding questions.
Basic coding questions
First round interview question was about converting a binary number to base 6. Second round interview was a question that had to do with priority queues.
google example questions on the internet
Viewing 1821 - 1830 interview questions