There were 5 rounds in total. The first was an aptitude round, the second was a coding round, and rounds 3, 4, and 5 were technical interviews and HR.

The aptitude round lasted for 107 minutes and had 90 questions. The aptitude and English sections were easy, but the technical MCQs were difficult.

Given a number ‘n’ and a digit ‘k’. Each time, remove k digits from the given number and find the least possible number from the remaining digits. Continue this until the number of digits in ‘n’ becomes less than or equal to ‘k’. Finally, return the smallest possible number. If the given number ‘n’ has fewer digits than ‘k’, then return the same number.

The second question was presented as a long story. However, after reading the entire question, I realized it could be solved using the DFS concept.