First Round: Coding test of one hour. Graphs, DP, and Trees were the main topics asked. Questions were of medium and hard difficulty. There was a question bank of 5 questions, from which everyone received 2 questions to solve within 1 hour.

Second Round: Shortlisted for Round 1 of the interview. A 45-minute technical round. One question was asked, which was solved using priority queues. Try to solve 2 medium-difficulty questions within 45 minutes.

Third Round: Shortlisted for Round 2, the final round. The interviewer asked a DP question, and then a question based on the DFS algorithm. The last 5 minutes were for basic HR questions, such as why you want to join the company and what you expect.

1. Suppose you are given an array of length 3 which contains the value acquired when you visit 3 cities. On a given day, you can either remain within the same city or travel to another city. You can start with any city. Determine the maximum value that can be acquired by the person at the end of 30 days.

2. Find the number of contiguous islands in a matrix where land is represented by 1 and water is represented by 0.