4 technical rounds and no HR round, Very easy questions at campus related to linked list and tree, and from project.
Given a Heap find Nth largest node. you have access to left and right node.
Interview questions [1]
Question 1
There were few good questions related to linked list.
