My Nation With Namo Interview Experience

Round 1: DSA

This was the toughest round, but also the most fun.

I first thought the problem was a DP one and started working in that direction. It didn’t feel right, so I tried a brute-force approach with DFS and backtracking. That worked, but it was slow and messy. Then I noticed I could treat it as a graph problem and solve it with Dijkstra’s Algorithm. That was the cleanest solution of the three.

I explained and coded all three approaches within the time. The interviewer didn’t just want the final answer. He kept asking why I switched approaches and what made me change my mind, so it felt more like a discussion than a test.

Round 2: DSA

This round was much easier. The question was to split an array into k subarrays so that the largest subarray sum is as small as possible.

It’s a classic Binary Search on Answer problem. I explained how to check whether a given sum is possible, and then coded it. It went smoothly and helped me feel more relaxed after the first round.

Round 3: Projects and Internship

This round was mostly a conversation. We talked about my projects in detail: how I built them, why I chose certain things, and what problems I faced along the way.

Then we moved on to my internship, what my work was and what I contributed. At the end, we also talked about the role itself and what the team expects from someone in this position.

Round 4: HR

A simple and friendly round. The usual HR questions came up, along with my salary expectations. We also talked about Gurugram possibly being the PPO location.

Result

Still waiting to hear back.