The first round of the interview was a HackerEarth coding challenge, featuring two questions: one hard and one medium. Clearing this round led to three to four technical rounds. I successfully cleared the first round and had a face-to-face coding interview on August 28th. The interview was rescheduled twice, but HR provided prior notice and made phone calls on the day.

In the coding round, two questions were asked: one concerning Linked Lists and another involving String manipulation and comparison. Although I answered both questions correctly, achieving the best possible time complexity, I was not selected for the next round. During the interview, the interviewer did not request any changes to my programs and seemed convinced with my solutions. I asked for feedback at the end of the interview, but the interviewer declined to provide any. Ultimately, I received an email from the TA team stating I was not selected for the next round.

One of the coding questions in HackerEarth was "Beautiful Numbers". In a face-to-face coding round, we were asked to find the number of rotations required to find the longest common prefix between two strings. Another problem involved sorting a linked list such that odd numbers appear first, followed by even numbers.