This round had 2 questions of easy/medium difficulty. Both were based on concepts of DP. The first question was quite similar to the classical DP question (minimum steps to reach 1) https://www.spoj.com/problems/MST1/ The second question was quite the same as https://leetcode.com/problems/longest-palindromic-substring/ In this, we are supposed to find the longest palindromic substring in a given string. The first question was fully solved and the second one was partially accepted since I used the brute force approach.

This round went quite well. In this, I was asked 2 questions. The first one was a medium level pattern searching question (strings). The second question was based on heaps (priority queues).

This round was also virtual. It has some difficult questions when compared to the previous rounds. The first question was similar to , the other question was based on a similar concept like , another one was This round went okayish and I was called for the next round.