cswork / libraryOpen practice workspace

Interview guides · Navi

Navi Software Engineer Interview Guide

Navi Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

A Software Engineer at Navi plays a pivotal role in reshaping the financial services landscape in India. Navi operates at the intersection of technology and finance, offering digital-first products across consumer lending, home loans, mutual funds, health insurance, and UPI payments. As an engineer here, you are not just writing code; you are building highly secure, low-latency, and massively scalable systems that democratize financial services for millions of underbanked users. The engineering team at Navi is structured around high ownership and rapid execution. Because the company handles critical transactional data, real-time underwriting, and instant disbursals, the systems you design must be exceptionally reliable and fault-tolerant.

This guide is scoped to a Software Engineer candidate at Navi.

Focus areas

  • Data Structures & Algorithms (DSA)
  • Problem Solving
  • System Design

The Navi interview process

Navi candidates report 4 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Online Assessment

Begin with an online assessment or a take-home coding assignment.

What to demonstrate

  • Begin with an online assessment or a take-home coding assignment
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Write a program to check if a string is a palindrome with at most one character deletion.
  • Answer aloud and timed: Given a 2D grid representing a map of 1s (land) and 0s (water), return the number of islands.

Core Evaluations

Evaluate core data structures and system design skills.

What to demonstrate

  • Evaluate core data structures and system design skills
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Design an efficient algorithm to solve the Course Schedule problem (detecting cycles in a directed graph).
  • Answer aloud and timed: Implement an optimized solution to find the sliding window maximum of an array.

Leadership Discussions

Conclude with discussions on leadership and cultural alignment.

What to demonstrate

  • Conclude with discussions on leadership and cultural alignment
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Perform a vertical order traversal of a binary tree and return its values.
  • Answer aloud and timed: Design an In-Memory Database that supports basic CRUD operations and is safe for multi-threaded access.

Onsite Interviews

Participate in back-to-back interviews at the office, especially for Bangalore roles.

What to demonstrate

  • Participate in back-to-back interviews at the office, especially for Bangalore roles
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Design a Smart House Automation System with modular controls for devices, schedules, and energy consumption.
  • Answer aloud and timed: Design a Library Management System with detailed class structures, booking workflows, and fine-calculating algorithms.

Where candidates lose points

Prepare for the take-home assignment thoroughly

If you are given a take-home assignment (like "The Ledger Co"), do not rush to submit it. Ensure you write comprehensive unit tests, adhere strictly to SOLID principles, use clean directory structures, and provide a clear README file.

Clarify requirements early in design rounds

In both LLD and HLD rounds, the problem statements are intentionally left ambiguous. Spend the first 10 minutes asking clarifying questions to define the scope, functional requirements, and non-functional assumptions before you start writing code or drawing diagrams.

Be resilient to scheduling shifts

Some candidates have reported sudden interview rescheduling or delayed feedback due to interviewers handling active production issues. Maintain your composure, stay proactive with your recruiter, and use the extra time to refine your preparation.

Questions & practice

Write a program to check if a string is a palindrome with at most one character deletion.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Given a 2D grid representing a map of 1s (land) and 0s (water), return the number of islands.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Implement an optimized solution to find the sliding window maximum of an array.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Perform a vertical order traversal of a binary tree and return its values.

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Design an In-Memory Database that supports basic CRUD operations and is safe for multi-threaded access.

Medium · Low-Level Design (LLD) & Machine Coding

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Why do you want to join Navi? What interests you about the fintech space?

Medium · Resume & Behavioral

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.

Approach

  1. Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
  2. Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
  3. Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
  4. State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.

Follow-up

  • A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
  • The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?

Design an efficient algorithm to solve the Course Schedule problem (detecting cycles in a directed graph).

Medium · Data Structures & Algorithms (DSA)

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Design a Smart House Automation System with modular controls for devices, schedules, and energy consumption.

Medium · Low-Level Design (LLD) & Machine Coding

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Design a Library Management System with detailed class structures, booking workflows, and fine-calculating alg

Medium · Low-Level Design (LLD) & Machine Coding

Design a Library Management System with detailed class structures, booking workflows, and fine-calculating algorithms.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Design a Parking Lot System detailing the classes, inheritance patterns, and allocation strategies.

Medium · Low-Level Design (LLD) & Machine Coding

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Implement a Ledger System (e.g., "The Ledger Co") that processes loans, EMI payments, and calculates outstandi

Medium · Low-Level Design (LLD) & Machine Coding

Implement a Ledger System (e.g., "The Ledger Co") that processes loans, EMI payments, and calculates outstanding balances.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Design the backend architecture for IRCTC to handle seat bookings on trains with high concurrency and strict t

Medium · High-Level Design (HLD) & Product Thinki

Design the backend architecture for IRCTC to handle seat bookings on trains with high concurrency and strict transaction guarantees.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Design a real-time, nested Facebook Comment Box system, focusing on API design, database schema, and frontend-

Medium · High-Level Design (HLD) & Product Thinki

Design a real-time, nested Facebook Comment Box system, focusing on API design, database schema, and frontend-backend synchronization.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Design a distributed workflow automation system to automate loan approval processes within Navi.

Medium · High-Level Design (HLD) & Product Thinki

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

How would you design a rate-limiting system for a critical API endpoint to prevent abuse while ensuring high a

Medium · High-Level Design (HLD) & Product Thinki

How would you design a rate-limiting system for a critical API endpoint to prevent abuse while ensuring high availability?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Walk me through the architecture of the most complex project on your resume. What were the key technical trade

Medium · Resume & Behavioral

Walk me through the architecture of the most complex project on your resume. What were the key technical trade-offs you made?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Listing latency scales with page size, not with filters

Easy · n+1 · latency · query batching

The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.

Approach

  1. Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
  2. Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
  3. Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
  4. Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.

Follow-up

  • The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
  • How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?

Suggested practice checklist

Built from the rounds and topics Navi candidates report.

Day 1 — Map the Navi loop

  • Write out the reported sequence: Online Assessment, Core Evaluations, Leadership Discussions, Onsite Interviews.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 4 reported rounds, with the weakest marked.

Day 2 — Work Data Structures & Algorithms (DSA)

  • Spend the session on Data Structures & Algorithms (DSA), which Navi candidates report being tested on.
  • Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.

Deliverable: One timed worked example in Data Structures & Algorithms (DSA).

Day 3 — Work Problem Solving

  • Spend the session on Problem Solving, which Navi candidates report being tested on.
  • Write one worked example in Problem Solving and time yourself on it.

Deliverable: One timed worked example in Problem Solving.

Day 4 — Work System Design

  • Spend the session on System Design, which Navi candidates report being tested on.
  • Write one worked example in System Design and time yourself on it.

Deliverable: One timed worked example in System Design.

Day 5 — Answer out loud: Data Structures & Algorithms (DSA)

  • Answer aloud, timed: Write a program to check if a string is a palindrome with at most one character deletion.
  • Answer aloud, timed: Given a 2D grid representing a map of 1s (land) and 0s (water), return the number of islands.

Deliverable: Spoken answers to 2 reported Data Structures & Algorithms (DSA) question(s), under time.

Day 6 — Answer out loud: Low-Level Design (LLD) & Machine Coding

  • Answer aloud, timed: Design an In-Memory Database that supports basic CRUD operations and is safe for multi-threaded access.
  • Answer aloud, timed: Design a Smart House Automation System with modular controls for devices, schedules, and energy consumption.

Deliverable: Spoken answers to 2 reported Low-Level Design (LLD) & Machine Coding question(s), under time.

Day 7 — Answer out loud: High-Level Design (HLD) & Product Thinking

  • Answer aloud, timed: Design the backend architecture for IRCTC to handle seat bookings on trains with high concurrency and strict transaction guarantees.
  • Answer aloud, timed: Design a real-time, nested Facebook Comment Box system, focusing on API design, database schema, and frontend-backend synchronization.

Deliverable: Spoken answers to 2 reported High-Level Design (HLD) & Product Thinking question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

Describe a situation where you had a technical disagreement with a peer or manager. How did you resolve it?

Medium · Resume & Behavioral

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell me about a time when a system you owned failed in production. How did you debug, mitigate, and prevent it

Medium · Resume & Behavioral

Tell me about a time when a system you owned failed in production. How did you debug, mitigate, and prevent it from happening again?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Argue against a design, lose, and commit anyway

Medium · disagreement · service boundaries · decision records

Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.

Approach

  1. State the prediction in falsifiable form up front: the mechanism, the condition that triggers it, and the observable outcome. A prediction that cannot be checked also cannot be credited to you later.
  2. Show the evidence you had at the time and label each piece honestly as measured, analogous, or intuition. Keeping the intuition is fine; disguising it as data is the thing that erodes your standing in the next argument.
  3. Represent the opposing case at full strength, including the constraint you did not control: a fixed date, a team boundary, or the fact that the decision was cheap to reverse and yours was not.
  4. Make disagree-and-commit concrete. Name the artefact you left behind so the prediction could be settled without you: the alert and its threshold, the counter on the dashboard, the decision note that recorded the trade-off and the condition that would revisit it.

Follow-up

  • What threshold on that alert would have proved you right, and did anyone ever look at it?
  • If the same proposal arrived tomorrow with the same deadline, would you argue it the same way?