Design a Movie Ticket Booking System
Model a customer journey that holds seats for a scheduled show and safely turns a valid hold into a booking.
Open practiceNavan interview practice
Practice from 14 Navan-tagged public coding problems, organized only by the stage, topic, difficulty, and recency metadata FastPrep can verify. The broader public catalog also includes 3 system-design exercises, 9 low-level-design exercises.
Full question list
| Problem | Difficulty | Stage | Last reported |
|---|---|---|---|
| Time Based Key-Value Store | Medium | Onsite | Dec 2025 |
| Type-Ahead Prefix Matches | Easy | Onsite | Dec 2024 |
| Roman to Integer | Easy | Phone | Oct 2024 |
| Sort Colors | Medium | Phone | Oct 2024 |
| Basic Calculator | Hard | Phone | Jun 2024 |
| LRU Cache | Medium | Phone | Jun 2024 |
| House Robber | Medium | Phone | May 2024 |
| House Robber II | Medium | Phone | May 2024 |
| Snake-Case Iterator to Camel Case | Medium | Phone | Feb 2024 |
| Minimum Steps on a Circular Character Dial | Medium | Onsite | Jan 2024 |
| Minimum Stick Connection Cost | Medium | Onsite | Jan 2024 |
| Shortest Substring with at Least K Distinct Characters | Medium | Onsite | Jan 2024 |
| Compare N-Ary Tree Leaf Sequences | Medium | Onsite | Nov 2023 |
| Lexicographically Largest Distinct-Letter Subsequence | Hard | Phone | May 2023 |
02 · Broader technical practice
These public Navan-tagged exercises cover additional technical formats. They are included only when a verified catalog record and a crawlable practice page both exist.
Model a customer journey that holds seats for a scheduled show and safely turns a valid hold into a booking.
Open practiceModel compatible parking for bikes, cars and five-spot buses, with atomic ticketed allocation and a nearest-entrance extension.
Open practiceDesign a durable multi-tenant worker queue with understandable network-failure semantics, bounded exponential-backoff retries, dead-letter handling, and explicit priority trade-offs.
Open practiceModel one application-scoped event manager, token-based subscriptions, snapshot delivery, and truthful per-callback outcomes.
Open practiceBuild an in-memory subscription center with pluggable channels and truthful partial-delivery reports.
Open practiceDesign provider boundaries and deterministic merging for normalized flight offers with partial results.
Open practiceModel booking comments, author ownership, privileged edits, bulk administration, and auditable outcomes.
Open practiceModel listing ownership, publication state, search attributes, updates, and extensible property details.
Open practiceModel calendars, events, overlap rules, shared availability, updates, and recurrence extension points.
Open practiceDesign a reliable reporting system that aggregates card transactions into timely, auditable spending reports.
Open practiceModel seat validation, payment authorization, airline confirmation, durable booking state, and compensation.
Open practiceDesign progress synchronization that lets viewers resume a title across devices without losing acknowledged progress.
Open practice03 · Evidence boundary
It means practicing transferable implementation, testing, and technical reasoning with public catalog assets FastPrep tags to Navan. It does not mean FastPrep has access to the company's assessments or any private interview bank.
Repeated public sightings and last-reported dates can help you prioritize practice, but they cannot predict the questions, format, or platform in a specific interview.
04 · Plain answers
This page owns technical-practice intent for Navan. Hiring activity, timelines, and market signals remain on the separate hiring-insights page.
The 14 Navan coding questions on FastPrep come from phone screens (8 questions) and onsite rounds (6 questions). Stages differ by role, level and date, so check your invitation for your own process.
Most Navan coding questions on FastPrep are medium. By difficulty, the 14 rated questions are 10 medium, 2 easy and 2 hard.
Across 14 Navan coding questions, the most common topics are String (7 questions), Array (4 questions), Dynamic Programming (3 questions), Hash Table (3 questions) and Stack (3 questions).
The most reported question is “Lexicographically Largest Distinct-Letter Subsequence” (2 reports).
Yes, when the public catalog supports it. This page currently links 3 system-design exercises, 9 low-level-design exercises, and 0 project-coding exercises tagged to Navan. Empty formats are omitted rather than padded with generic recommendations.
No. FastPrep is an independent interview-preparation product and is not affiliated with Navan. The page uses FastPrep's public practice catalog and does not claim official, private, leaked, or proprietary employer questions.
Stage labels come from FastPrep's public problem metadata. A problem can carry more than one reported stage, and hiring processes can change by role, level, location, and date. Treat the labels as preparation context, not a guarantee.
Start with the stage named in your invitation or recruiter message. If no stage is known, use the largest available set to build general problem-solving fluency, then rehearse explanation and testing separately.
No. Public catalog counts, stage tags, and last-reported dates can help prioritize practice, but they cannot predict a specific interview's questions, sequence, timing, or platform.
Your next stage, made concrete
Start with the stage named in your invitation, then use public evidence as context—not as a promise of what you will be asked.
Open the practice set