The interview process at my university involved 50 candidates. I had to wait 6 hours for the first technical round and then had my second technical round an hour later. The questions were based on Dynamic Programming (DP) and Binary Search Trees (BST), at a medium difficulty level.

I was asked to wait for a third round. After waiting for 4 hours, I was told to leave, with the explanation that the interview process was complete and those selected for HR had already been contacted individually.

To find the size of the maximum square in a matrix of black and white boxes using dynamic programming.