I don’t remember the questions exactly, but one was of DP and the other was a Tree question
Round 2: Technical Interview
Problems:
A minimum number of platforms required for a railway. We are given two arrays that represent the arrival and departure times of trains that stop at the platform. We need to find the minimum number of platforms needed at the railway station so that no train has to wait.
Count Possible Decodings: Let 1 represent ‘A’, 2 represent ‘B’, etc. Given a digit sequence, count the number of possible decodings of the given digit sequence.
Rotting Oranges, Given a grid of mXn matrix, where each cell has the following values: 0,1,2. Every minute, if a Fresh Orange is adjacent to a Rotten Orange in 4-direction ( upward, downwards, right, and left ) it becomes Rotten. Return the minimum number of minutes required such that none of the cells has a Fresh Orange. If it’s not possible, return -1.
Round 4: Technical + Managerial
Convert a given Binary Tree to a Doubly Linked List