Phone Screen:
Interview Started with the self introduction and resume discussion and some questions on OS, Stacks/Queues, Static/Dynamic Memory for about 15-20 minutes.
Then we moved on to coding question where given was a root and the level(L), return the head of the new linked list created consisting of elements of that level(L).
I gave him the iterative approch and then he followed up for the space optimzation and reccursive solutions.

On-Campus/On-Site Interviews:
Round-1:

• Brief discussion on resume. In-Depth explanation of projects
• Give a list of lists, with two values(a, b) in every list with a > b, find the relation between new query, (x, y) with the help of list of values Given.
• Example: Input: [[1, 2], [1, 4], [4, 7], [7, 5]], [X, Y] = [1, 5]
• Output: TRUE (Because, 1 > 5 from the relation we found from the Input)
• Explanation: 1 is taller than 4, 4 is taller than 7, 7 is taller than 5, so, 1 is taller than 5. Return 5
• If given, X, Y = 5, 1 ==> Return False.
• If given, X, y = 2, 4 ==> Return Undefined. (no relation can be deduced)

Waiting for the further confirmation.