At the very beginning, the interviewer started with a basic introduction. She then asked about my projects, the technologies I have used, and my main motivation for undertaking those projects.

Moving on to the technical interview, she presented two coding questions. The first was relatively easy, related to a binary tree that could be solved using a DFS traversal technique. I solved this question within five minutes, and she was pleased with my solution, my approach, and how I explained it.

Next, she asked a dynamic programming question. I got stuck at this point, but she helped me understand the question. However, I was unable to answer it.

Given a binary tree having numbers from 1 to 9, find the sum of all numbers formed by the paths from the root to the leaves in the binary tree.