Navi SDE-1: 2022 On-Campus Interview Questions
A 2022 Navi on-campus SDE-1 account reported a DoSelect assessment, technical interview, and hiring-manager interview.
on this page§ 07
What the Navi campus account reports
The source describes a quant-heavy assessment for one Navi SDE-1 campus drive. It includes separate aptitude and mathematics sections alongside coding. The source does not explain why the test was designed that way, so this article does not attribute the pattern to Navi's products, founders, or company-wide hiring philosophy.
As posted in a GeeksforGeeks interview experience for an on-campus SDE-1 drive (Navi visited the campus in August 2022), the process ran three rounds. The first was a 2-hour online assessment on the DoSelect platform, split into four sections. The Aptitude section carried 20 questions covering profit and loss, ratio and proportion, compound interest, clocks, and logical reasoning. The Math section was even heavier at 25 questions on permutation and combination, probability, algebra, number theory, and equations. The coding portion was divided into two levels: Coding Level A had 2 questions (tree traversal and string encoding) and Coding Level B had 1 question on stock trading with K transactions.
The account says nineteen students cleared the online test. The second round was a forty-five-minute technical interview over Google Meet, where the candidate was asked to find a triplet summing to a target and the median of a running integer stream. Twelve candidates advanced. The final reported round lasted an hour, involved two interviewers, and covered the candidate's internship experience plus a BST problem. Five candidates were selected.
No CGPA cutoff or CTC figure was disclosed in the GeeksforGeeks account, so treat these as specific to that 2022 campus drive. The round count, section breakdown, and question difficulty level are useful as a pattern guide for your 2026 preparation, but you should verify the current process on Navi's official careers page (navi.com/careers) before your campus drive begins.
Round-by-round breakdown and question pattern
Here is the detailed round structure as reported by the candidate on GeeksforGeeks, with prep notes for each section:
| Round | Duration | Platform / Mode | Sections / Questions | Cleared By |
|---|---|---|---|---|
| Round 1: Online Test | 2 hours | DoSelect (online) | Aptitude (20 Q), Math (25 Q), Coding Level A (2 Q), Coding Level B (1 Q) | 19 cleared; initial pool not stated |
| Round 2: Technical Interview | 45 minutes | Google Meet | Triplet sum to K, running median of integer stream | 12 advanced |
| Round 3: Hiring Manager Round | 1 hour | Google Meet (2 interviewers) | Internship experience discussion + BST problem | 5 finally selected |
Online test section breakdown
| Section | Question Count | Topics reported in this account |
|---|---|---|
| Aptitude | 20 | Profit and loss, ratio and proportion, compound interest, clocks, logical reasoning |
| Math | 25 | Permutation and combination, probability, algebra, number theory, equations |
| Coding Level A | 2 | Tree traversal, string encoding |
| Coding Level B | 1 | Stock trading with K transactions |
The mathematics section is a clear differentiator within this account because it had its own reported question set alongside aptitude and coding. Candidates using this account for preparation should review permutation and combination, probability, algebra, number theory, and equations. The source does not support comparisons with other companies or guarantee that a current Navi assessment keeps this structure.
Technical interview question analysis
The technical interview included these two candidate-reported problems:
Triplet sum to a target: One standard approach sorts the array and scans with two pointers for each fixed element. Discuss how sorting changes the input, how duplicates are handled, and whether the prompt asks for values, indices, or merely existence. A hash-based alternative has different space and duplicate-handling trade-offs.
Running median of an integer stream: A two-heap solution keeps the lower values in a max-heap and upper values in a min-heap. Explain the size invariant, ordering invariant, rebalancing step, and how the median is defined when the observation count is even.
Hiring manager round
The final reported round lasted an hour with two interviewers. It combined a discussion about the candidate's internship experience with a BST problem. That is evidence that this candidate's final stage was not purely conversational, but it does not establish a standard Navi hiring-manager rubric.
Preparation mapped to the reported questions
Use the reported pattern to identify gaps, then replace it with the current role notice and assessment instructions when those arrive.
Build the math and aptitude base
The reported assessment gave mathematics and aptitude their own sections. Review the named areas rather than assuming coding practice alone covers the test:
- Profit and loss, compound interest, ratio and proportion: Practise translating wording into variables before calculating.
- Permutation and combination: Cover arrangements, selections, repeated objects, and circular cases while stating why an ordering rule applies.
- Probability: The source names probability but not its subtopics. Use the current assessment scope, and define events and assumptions before calculating.
- Number theory and algebra: Cover divisibility, GCD/LCM, modular arithmetic basics, and quadratic equations.
- Clocks and logical reasoning: These are smaller topics but appeared in the reported test, so do not skip them entirely.
DSA fundamentals and tree problems
Based on the reported question set, prioritise these topics:
- Arrays and two-pointer techniques: Practise pair-sum and triplet-sum variants, paying attention to duplicates and whether the array may be modified.
- Trees and tree traversal: Inorder, preorder, postorder, level order, and BST operations. The reported test had a tree-traversal question and the hiring-manager round had a BST problem, which supports reviewing the underlying operations without claiming a company-wide frequency.
- Heaps and priority queues: For the reported running-median task, define the two heap invariants, rebalancing rules, and even-count median before implementing it.
- Dynamic programming basics: The reported assessment included stock trading with a transaction limit. Be able to define state, transition, base case, and space optimisation without memorising code blindly.
- Strings: The source names string encoding without publishing its contract. Practise clarifying the encoding rule, delimiters, invalid input, and reversibility instead of adding unreported string problems.
Mock interviews and full-length tests
- Use timed mixed tests to expose transitions between aptitude, mathematics, and coding. Do not treat the historical section count as a confirmed current format.
- Run mock technical interviews with a peer or mentor, focusing on requirements, approach, invariants, complexity, and tests before final code.
- Prepare your internship or project discussion for the hiring manager round. Be ready to explain architecture decisions, tradeoffs, and what you would do differently.
Common mistakes and what NOT to do
- Ignoring the reported mathematics section: The historical account names permutation and combination, probability, algebra, number theory, and equations. Review them if this account exposes a gap, while checking the current invite for the actual scope.
- Optimising for labels instead of skills: The source names tree traversal, string encoding, triplet sum, running median, and stock trading with a transaction limit. Practise the underlying invariants and edge cases instead of relying on a difficulty label.
- Not practising spoken explanation: The reported technical interview combined problem solving and discussion. Practise explaining requirements and trade-offs while coding instead of narrating syntax.
- Treating the hiring-manager round as purely behavioural: The reported final round included a BST problem. Follow the current invitation while keeping the reported technical task in your preparation map.
- Not verifying the current pattern: The source is a 2022 on-campus experience. Navi may have changed its process, platform, or round structure since then. Always confirm the latest details on the official Navi careers page before your drive.
- Skipping the reported stock-DP pattern: The stock-trading problem adds a transaction limit to the state. Practise defining the state, transition, base cases, and complexity instead of assuming familiarity with simpler DP transfers automatically.
Real-world data points
- 3 total rounds in the candidate-reported 2022 on-campus SDE-1 drive (source: GeeksforGeeks interview experience)
- 2-hour duration for the Round 1 online test on the DoSelect platform
- 20 aptitude questions and 25 math questions in the online test (45 total quantitative questions)
- 3 coding questions across 2 levels (2 Level A, 1 Level B) in the online test
- 19 students cleared Round 1 (online test)
- 45-minute duration for the Round 2 technical interview on Google Meet
- 2 DSA problems in the technical interview (triplet sum to K, running median)
- 12 candidates advanced past the technical interview
- 1-hour duration for the Round 3 hiring manager round with 2 interviewers
- 5 candidates were finally selected
- No CGPA cutoff or CTC figure was disclosed in the source account
FAQ
How many rounds are there in Navi Technologies SDE-1 on-campus interview 2026?
Based on a candidate-reported 2022 on-campus experience posted on GeeksforGeeks, Navi conducted 3 rounds: a 2-hour online test on DoSelect, a 45-minute technical interview on Google Meet, and a 1-hour hiring manager round. The exact round count may change by cycle, so confirm on Navi's official careers page for the 2026 process.
What kind of coding questions does Navi ask in the online test?
The candidate-reported 2022 online test included tree traversal, string encoding, and a stock-trading problem with a transaction limit. The source labelled coding sections as Level A and Level B. A current assessment may use different questions or labels.
Is there a CGPA cutoff for Navi Technologies on-campus placement?
The GeeksforGeeks interview experience did not mention a CGPA cutoff. Use only the eligibility rule stated in the current role notice, campus mail, or placement-cell instructions.
Does Navi Technologies ask math questions in the online test?
Yes, in the reported 2022 cohort. The account describes a dedicated mathematics section with twenty-five questions on permutation and combination, probability, algebra, number theory, and equations. It does not verify a current section count.
What DSA topics should I prepare for Navi technical interview?
Based on the reported interview, review arrays for triplet-sum problems, heaps for running median, and binary search trees. These are evidence-backed topics from one account, not a complete current Navi syllabus.
Sources & credits
Sources and review notesreviewed 9 Aug 2026
Official notices, candidate reports, offer documents, and editorial practice questions carry different confidence levels. The visible source list lets you inspect the evidence instead of relying on a blanket verification badge.
topic cluster
More resources in Interview Questions
Use the category hub to browse similar questions, exam patterns, salary guides, and preparation resources related to this topic.
paid contributor programme
Sat this this year? Share your story, earn ₹500.
First-person experience reports help future candidates prep smarter. We pay verified contributors ₹500 via UPI per accepted story with byline.
Submit your story →ready to practice?
Take a free timed mock test
Put what you learned into practice. Our mock tests match the 2026 pattern with timer, navigator, reveal, and score breakdown. No signup.