Last year, I interviewed for a Software Engineer role. After applying, I received the online assessment (OA) within three days and successfully cleared it, which led to the on-site interviews.

The on-site process consisted of three rounds:

• Two technical interviews (each featuring two LeetCode-style problems)
• One behavioral round

I was given a total of two Medium, one Easy, and one Hard question. Although I solved most of them, I struggled with one of the Medium problems.

I received a rejection a week later, but the experience was incredibly valuable—it helped me identify key areas to improve and strengthened my interview preparation for the future.

One of the key questions I was asked centered around binary trees, with a follow-up that required adapting the solution to work with N-ary trees. This added an extra layer of complexity in terms of traversal and state management.