The online test consisted of three questions to be solved in 1.5 hours. The problems were: Trim a BST, pattern matching, and finding the first non-repeating character.

Out of 250 students, 68 were shortlisted for another test conducted on paper. We were asked to solve two DP problems:

• The number of deletions required in an array to make it sorted in increasing order.
• The word break problem.

There was a group discussion round after this, where we were given a problem and had to come up with plausible approaches to solve it as part of the discussion.

After this round, there were three rounds of technical interviews and one HR interview.

DP problems