The technical interview session was set up on HackerRank, followed by an HR phone screening. The first 10-15 minutes were for introductions with the interviewer, followed by a 30-minute coding session to solve a problem in HackerRank.

Please be mindful of the time spent on the introduction session, as it is better to allocate more time for problem-solving. The problem-solving time was too short.

Solve the problem in HackerRank code live.

10-15 min introduction with interviewer and 30 min to solve the problem. The problem was the Candy Crush problem: write a program such that for a given string, if three or more repeating adjacent alphabets can be removed.

Initially, I was solving this without a recursive approach. It got messy after removing the substring of repeating strings. Then, when it returned, it might have repeating strings again, like "abbbaac" => "aaac" => "c".