Navan coding interview
questions, leaked.
4 problems reported across recent Navan interviews. Top patterns: hash table, array, dynamic programming. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Navan's coding assessment hits you with four problems across medium and hard difficulty. You're looking at hash tables and arrays as the core demand, backed by dynamic programming and design questions. LRU Cache is a classic that tests your ability to combine data structures under time pressure. Word Ladder forces you to think in graphs. Trapping Rain Water is a trap itself, easy to brute force and time out. If you blank on any of these patterns during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, so you keep moving.
Top problems at Navan
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | LRU Cache | MEDIUM | 100.0 | 45% | Hash Table · Linked List · Design |
| 02 | Word Ladder | HARD | 89.4 | 43% | Hash Table · String · Breadth-First Search |
| 03 | Trapping Rain Water | HARD | 89.4 | 65% | Array · Two Pointers · Dynamic Programming |
| 04 | Paint House | MEDIUM | 89.4 | 64% | Array · 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 Navan OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- hash table2 · 50%
- array2 · 50%
- dynamic programming2 · 50%
- string1 · 25%
- breadth first search1 · 25%
- two pointers1 · 25%
- stack1 · 25%
- monotonic stack1 · 25%
- linked list1 · 25%
- design1 · 25%
The distribution tells you something: Navan wants to see if you can think in multiple layers. Hash tables appear twice, arrays twice, and dynamic programming twice, meaning you can't just memorize one approach. The hard problems dominate the set, so your prep should assume you'll face algorithmic depth, not breadth. LRU Cache tests design and implementation together, which filters out candidates who've only seen toy problems. Word Ladder requires you to map a problem to graph traversal, which is less obvious than it sounds. Trapping Rain Water is the killer: the monotonic stack solution is elegant, but the DP and two-pointer approaches are also valid, and picking the wrong one under pressure wastes ten minutes. Study design patterns and multi-step algorithms first, then drill the monotonic-stack variant hard. During the assessment itself, StealthCoder is your hedge if the pattern doesn't click in the first minute.
Companies with similar patterns
If you prepped for Navan, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Navan.
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. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Navan interview FAQ
How many hash-table problems should I solve before the Navan OA?+
Hash tables hit twice in Navan's set, so drill at least 8-10 problems covering collision handling, load factors, and custom hashing. LRU Cache is the high-bar example here. Focus on problems that combine hashing with another structure, not isolated hash problems.
Is dynamic programming enough to prepare for Navan, or do I need stack too?+
DP appears twice, but so does the stack pattern. Don't skip either. Trapping Rain Water specifically tests all four approaches (DP, two pointers, stack, monotonic stack), so understanding why the monotonic stack is optimal matters more than solving it ten ways.
Should I study design problems before or after algorithms?+
Study algorithms first, then design. LRU Cache is a design problem, but you need solid hash-table and linked-list fundamentals to execute it. Build the building blocks, then combine them under pressure during your mock interviews.
How much time should I spend on Trapping Rain Water?+
This problem deserves 2-3 hours across multiple days. It's deceptively hard and tests multiple paradigms. Learn the brute force, then the DP solution, then the stack, then the two-pointer approach. Understanding the trade-offs is what filters candidates.
Is Word Ladder a graph problem I need to memorize, or can I derive it?+
Word Ladder is a breadth-first-search problem disguised as a word puzzle. You don't memorize it, but you need to recognize that a level-by-level search is the right pattern. Practice mapping word-construction constraints to graph edges before your assessment.