Navi SDE 1 Campus Guide: The Campus OA With a Debugging Question
Prepare for Navi software engineer interviews with reported assessment patterns, interview questions, and preparation advice.
On this page
Last reviewed November 16, 2026.
For students interviewing for SDE 1.
Built by the Codinzhub team from Navi online assessment questions that IIT students shared on Codinzhub between October 30 and November 5, 2026. Each question is one student's memory of their paper, so use this as a map, not a promise.
The 30-second version. Navi hires freshers on campus as SDE 1. The OA is 3 questions in 60 to 90 minutes, and one of them is always a "fix the code" debugging question: the logic is mostly right, and you must find two or three bugs, sometimes in
main()rather than the function. The other two are medium coding: rotating each layer of a matrix, counting a word in a grid, a palindrome check on half a string, or a graph problem. It ran at IIT Delhi, IIT Roorkee and IIT (BHU) Varanasi. After the OA come DSA interviews and a hiring manager round.
How this guide was built. The OA section comes entirely from questions IIT students posted on Codinzhub. No student has posted Navi interview rounds yet this season, so the interview section is the Codinzhub team's research into Navi's earlier campus drives, and we mark it clearly.
Other Navi roles: SDE 1 · Data scientist · Business analyst
Round-by-round breakdown
Stage 1: Shortlisting
What to expect. From our research: earlier Navi drives used a CGPA cutoff (reports mention 7, and one year 8.5) for the shortlist. Check your placement cell's notice.
Stage 2: Online assessment
At a glance
- Length: 60 to 90 minutes
- Questions per round: 3: two coding and one debugging
- What was asked: matrix layer rotation, grid word search, palindromes, graphs, trees, and a buggy program to fix
- Most common: rotating each layer of a matrix (IIT Roorkee); counting a word in a grid (IIT Delhi)
The debugging question. You get a program that almost works. In one version the bucket sort by digital root had two logic errors. In another, the jump game solver was correct and the bugs were in main(), in how input was read and output printed. Read the whole program, not just the function.
IIT Roorkee, November 1 and 2
| # | Question (our summary) | How to approach it | Practice |
|---|---|---|---|
| 1 | Rotate every concentric layer of an m by n matrix by r positions (clockwise in one version, anticlockwise in another) | Peel each layer into a list, rotate by r mod its length, write it back | Rotate Each Layer of a 2D Matrix, Matrix Layer Rotation, Get Final Output, Rotate Matrix |
| 2 | Split each string in half; can the right half be rearranged into a palindrome? Print YES or NO | Count letters in the right half; at most one odd count. Watch odd lengths | Right Half Palindrome, Palindrome, Right Portion Palindrome |
| 3 | Fix the code: group or sort numbers into 10 buckets by digital root; two logic errors | Digital root is 1 + (n − 1) mod 9 for n > 0, and 0 for 0. Check the bucket index and the loop bounds | Digital Root (Fix the Code), Debugging |
IIT Delhi, October 30 to November 1
| # | Question (our summary) | How to approach it | Practice |
|---|---|---|---|
| 1 | Count how many times a word appears in a letter grid, reading in any of 8 fixed directions | For each cell and direction, check the word fits and matches | Count Word Occurrences in a Grid, Count Matching Words in a Grid, Word Search II |
| 2 | From an adjacency matrix or edge list, find the most popular people whose neighbours are also popular | Degree of each node, then score each node by its neighbours' degrees | Most Popular People, Most Influential Node |
| 3 | Fix the code: minimum jumps to reach the end of an array; bugs in main() | Check input reading and output, not only the solver | Fix the Code, Jump Game II, Error Finding |
| 3 (other paper) | Minimum fuel for representatives in a tree to drive to the capital, cars with fixed seats | DFS: people in each subtree, divided by seats, rounded up, summed per edge | Minimum Fuel Cost to Report to the Capital |
IIT (BHU) Varanasi, November 5
| # | Question (our summary) | How to approach it | Practice |
|---|---|---|---|
| 1 | A binary tree given as (position string, value) pairs; sum the nodes that have two children | Put positions in a hash set; a node is full if both child positions exist | Sum of Full Binary Nodes |
| 2 | Stations in a connected graph; work out the maintenance cost of the "super tunnels" | Graph traversal; read the cost rule closely | Super Tunnel Maintenance Cost |
| 3 | A debugging question | Read the whole program |
The BHU paper format was stated as 2 coding plus 1 debugging.
More questions: Browse Navi questions.
Stage 3: Technical interviews
At a glance
- Length: about an hour each
- Questions per round: about 3 DSA problems
- What was asked: arrays, trees, graphs, DP
- Most common: state the approach quickly, then write full code
What to expect. From our research into earlier Navi drives: one or two DSA rounds with about three problems each. Interviewers want the approach fast and then working code. Earlier candidates were rejected for not reaching the optimal solution on one question, so always push past brute force.
Stage 4: Hiring manager round
What to expect. From our research: about an hour, mostly about your internship and projects, with some behavioral questions. Know what Navi does: lending, insurance, mutual funds and UPI payments in one app.
Topics to prioritise
From the 2026 papers: matrix layer traversal, grid search in 8 directions, counting characters, graph degrees and tree DFS, and above all reading and debugging someone else's code.
The Codinzhub Next-Round Playbook
What IIT students who sat this OA recommend. Put together by the Codinzhub team from the Navi questions in this guide.
To get past the OA
- Practise matrix layer rotation until you can write it in 10 minutes.
- For the debugging question, run the program on the sample first, then read input and output code as carefully as the logic.
- Do the debugging question early; it is usually the fastest marks.
To get past the interviews
- Always give the optimal solution before time runs out; brute force alone was a rejection reason before.
- Prepare a clear story about your internship.
About this guide
This guide is researched and written by the Codinzhub team from questions IIT students shared on Codinzhub, plus research into Navi's earlier campus drives where student reports are missing. Questions are our own short summaries; the practice links open the full question on Codinzhub. Sat this OA or the interviews? Share your experience on Codinzhub and we will update the guide.
Keep track of what you’ve learned.