There was no test – directly interviews.
Round 1:
The interviewer was pretty cool, looked like a 20 yo guy.
Q1. Convert a tree into its sumtree in place
Q2. Clone a linkedlist with random pointer
Round 2:
Given a min heap find second largest element in it.
Print a 2d matrix in spiral order
After this round, the HR told me I didn’t got through.
Article Tags :
Recommended Articles