The first round was an online coding round.

It consisted of 4 problems with a medium difficulty level. I solved all the questions partially and was selected for the next round.

The next 2 rounds were face-to-face virtual interviews, which mainly focused on problem-solving, with some questions based on my resume.

The final round was with the Hiring Manager. It was more of a casual talk, where the HM explained the work culture, hiring process, career development, and learning opportunities for a fresher at PhonePe.

Sum of 2 very large numbers represented as strings.

Find 2 nodes of a binary tree that sum up to a given number (if they exist).

Find a path from root to leaf of a binary tree such that the sum of all nodes in the path is equal to a given number (if a path exists).