Consisted of a total of 3 rounds.

1. The first was an online coding round held on HackerEarth.

   • A total of 3 questions were asked in this round, based on Data Structures and Algorithms.

2. The second round was conducted on Zoom.

   • It was a one-on-one round, entirely based on Data Structures and Algorithms.
   • 4 questions were asked, and 1 was from Object-Oriented Programming (OOPs) design.

3. The third round was also on Zoom.

   • It was a Data Structures and Project round with more inclination toward OOPs implementation.

Coding Round:

1. Modification of Painter Partition Problem using binary search.
2. Matrix Exponentiation problem on query optimization.
3. Normal sliding window problem.

Second Round:

1. House Robber DP on N-ary tree problem.
2. Interval merging problem.
3. Minimum jump to reach the last index problem (DP).
4. Binary lifting problem to find the k-th ancestor of a node.

(Code was to be written for each problem with corner cases.)