For the first round, I had a technical phone interview, which was basically a LeetCode medium-level question. It was designed to assess mainly your knowledge in DSA and see what you know.

The second round was another technical interview, but a little harder, and ideally, you should receive minimum hints.

Write a function to crush candy on a one-dimensional board.

In candy crushing games, groups of like items are removed from the board. In this problem, any sequence of 3 or more like items should be removed. Any items adjacent to that sequence should now be considered adjacent to each other.

This process should be repeated as many times as possible. You should greedily remove characters from left to right.