A very lengthy and time-consuming process with in-depth DSA-based interviews. The initial interviewers were friendly. After all the rounds, no feedback was received. Hence, there was no scope to improve on weak points.

Round 1 (Technical)

• Convert a binary tree to a doubly linked list.
• In an array, find the minimum window with a sum greater than k.
• Some LP/Behavioral questions.

Round 2 (Technical)

• Given two sorted arrays, find k pairs with the greatest sum.

Round 3 (Managerial)

• 30 minutes of LP/Behavioral questions.
• Given a lengthy string and a string of characters, find the minimum length substring of the lengthy string that contains all characters from the second string.

Round 4 (Bar-Raiser)

• 45 minutes of LP/Behavioral questions.
• Perform a topological sort of a graph.