Some questions on my Resume and CS fundamentals. Then there were 2 DSA questions with many modifications as progressed. Q1: Balanced parentheses. Q2: Infix to postfix conversion Then 2 DBMS queries were asked. Round 2: Q1: Cycle Detection and removal in Linked List Q2: 2 arrays - in time and out time of customers are given, you have to tell the max number of customers present at any time. Q3: A valid BST is made invalid by swapping 2 nodes. You have to make it valid again. A follow up on the same if more than 1 pair of nodes are swapped.
