Navi coding interview
questions, leaked.
4 problems reported across recent Navi interviews. Top patterns: array, binary search, dynamic programming. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Navi's assessment leans hard on arrays and binary search. You're looking at four problems total: three medium, one hard. The easy-problem shortage means there's no warm-up round. Arrays show up in every single question, and binary search hits 75% of the test. Your prep window is narrow, so drill array-based binary search patterns first. Trapping Rain Water anchors the hard slot. If you blank mid-assessment, StealthCoder runs invisibly and surfaces working code in seconds, no proctor visibility.
Top problems at Navi
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimize the Maximum Difference of Pairs | MEDIUM | 100.0 | 51% | Array · Binary Search · Dynamic Programming |
| 02 | Minimum Number of Days to Make m Bouquets | MEDIUM | 80.7 | 55% | Array · Binary Search |
| 03 | Search in Rotated Sorted Array | MEDIUM | 66.2 | 43% | Array · Binary Search |
| 04 | Trapping Rain Water | HARD | 66.2 | 65% | Array · Two Pointers · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Navi OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- array4 · 100%
- binary search3 · 75%
- dynamic programming2 · 50%
- greedy1 · 25%
- sorting1 · 25%
- two pointers1 · 25%
- stack1 · 25%
- monotonic stack1 · 25%
This dataset is tight and pattern-heavy. Every problem touches arrays. Binary search dominates at three questions, so if you can't bsearch efficiently over an array, you lose 75% of the assessment. Dynamic programming appears twice, but it's bundled with greedy and sorting in the same problems, meaning it's a tie-breaker approach, not the main path. Trapping Rain Water is the known hard problem and will eat time if you haven't seen the monotonic-stack trick. Start with Search in Rotated Sorted Array and Minimum Number of Days to Make m Bouquets: both medium, both binary-search-forward, and they build the muscle memory you need. Minimize the Maximum Difference of Pairs pulls in greedy and DP as secondary tools. If you hit the hard problem and stall, StealthCoder is your safety net on the live assessment.
Companies with similar patterns
If you prepped for Navi, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Navi.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Navi interview FAQ
How many binary search problems should I solve before the Navi assessment?+
Three out of four Navi problems involve binary search. Solve at least five to eight variations before your OA, focusing on search-on-answer and monotonic-predicate patterns. The two medium ones here, Search in Rotated Sorted Array and Minimum Number of Days, are your must-solves.
Is dynamic programming required to pass Navi's test?+
No. DP appears in two of four problems, but it's paired with greedy and sorting as alternate routes. Nail the binary search and array fundamentals first. If you're comfortable with bsearch and two pointers, you can solve at least three questions without DP.
What's the hardest topic on the Navi assessment?+
Trapping Rain Water, the sole hard problem, relies on monotonic-stack or two-pointer thinking. Most candidates skip it under time pressure. If you've seen this problem before, you win the hard slot. If not, focus prep on the three mediums and use that as your anchor.
Should I study sorting for Navi?+
Sorting appears once, bundled into Minimize the Maximum Difference of Pairs. It's not a standalone topic. Spend 80% of your time on binary search and arrays, 15% on DP variants, and 5% on sorting optimizations.
How much time should I spend on greedy approaches?+
Greedy shows up once and is secondary to binary search in the same problem. Don't dedicate separate drill time. Learn it as a tie-breaker when you're optimizing Minimize the Maximum Difference of Pairs after you've nailed the bsearch version.