Navi SDE 2 [2026] Interview Experience
Summary
I completed five interview rounds for the SDE 2 role at Navi, including DSA, machine coding, system design, culture fit, and hiring manager, all conducted on the same day.
Full Experience
Sharing my interview experience for the SDE 2 role at Navi. The process consisted of 5 rounds, with all the onsite rounds happening on the same day.
Round 1: DSA (60 mins) - Virtual
The round consisted of two coding problems:
-
Minimum steps/jumps to reach the last index of an array LeetCode 45 - Jump Game II
-
Find the K closest elements to a given number X in a sorted array LeetCode 658 - Find K Closest Elements
Round 2: Machine Coding (90 mins) - Onsite
Design and implement an Expense Tracker application, similar to Splitwise.
The focus was on designing the application with appropriate classes, interfaces, and extensibility, followed by implementing the core functionality.
Round 3: System Design (60 mins) - Onsite
Design a booking application supporting Metro and Bus bookings.
The discussion covered the overall system design and the components required to support the booking flow for both transportation modes.
Round 4: Culture Fitment (30 mins) - Onsite
This round focused primarily on my previous projects and experiences.
I was given different scenarios and asked questions around how I had handled them, with the discussion focusing on the behaviours I demonstrated in those situations.
Round 5: Hiring Manager (60 mins) - Onsite
The discussion was primarily around the projects I have worked on in my current organization.
There were detailed questions about my contributions, technical decisions, and the work I had done across my projects.
Overall Process
- Round 1: DSA - Virtual
- Round 2: Machine Coding - Onsite
- Round 3: System Design - Onsite
- Round 4: Culture Fitment - Onsite
- Round 5: Hiring Manager - Onsite
All four onsite rounds were conducted on the same day.
Hope this helps anyone preparing for the Navi SDE 2 interview process. Good luck!
Interview Questions (2)
Jump Game II
Find the minimum number of jumps required to reach the last index of an array, where each element represents the maximum jump length from that position.
Find K Closest Elements
Given a sorted array, a target value X, and an integer K, return the K closest elements to X in the array.