Zoox coding interview
questions, leaked.
9 problems reported across recent Zoox interviews. Top patterns: array, string, two pointers. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Zoox's assessment is 78% medium difficulty, which means you're walking into problems that assume you know the patterns cold. With only 9 reported problems, the data is tight, but it's telling: array problems dominate (5 out of 9), followed by strings (3). Most candidates freeze on medium problems because they try to code first instead of pattern-matching. Best Time to Buy and Sell Stock, 4Sum, and Rotting Oranges are the anchors here. If you blank on any of these mid-assessment, StealthCoder solves it invisibly while you stay calm and keep moving.
Top problems at Zoox
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Best Time to Buy and Sell Stock | EASY | 100.0 | 55% | Array · Dynamic Programming |
| 02 | Minimum Number of Frogs Croaking | MEDIUM | 72.5 | 51% | String · Counting |
| 03 | Basic Calculator II | MEDIUM | 72.5 | 46% | Math · String · Stack |
| 04 | String Compression | MEDIUM | 58.8 | 58% | Two Pointers · String |
| 05 | Rotting Oranges | MEDIUM | 58.8 | 57% | Array · Breadth-First Search · Matrix |
| 06 | H-Index | MEDIUM | 58.8 | 40% | Array · Sorting · Counting Sort |
| 07 | 4Sum | MEDIUM | 58.8 | 38% | Array · Two Pointers · Sorting |
| 08 | Fibonacci Number | EASY | 58.8 | 73% | Math · Dynamic Programming · Recursion |
| 09 | Design Circular Queue | MEDIUM | 58.8 | 53% | Array · Linked List · Design |
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 Zoox 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- array5 · 56%
- string3 · 33%
- two pointers2 · 22%
- dynamic programming2 · 22%
- math2 · 22%
- sorting2 · 22%
- breadth first search1 · 11%
- matrix1 · 11%
- counting1 · 11%
- stack1 · 11%
The topic distribution confirms Zoox leans heavily into data structures over algorithmic theory. Array problems are the core, but they're wrapped around two-pointers, sorting, and occasionally dynamic programming (Fibonacci, Stock). Strings show up 3 times, usually paired with harder manipulation (String Compression, Minimum Number of Frogs Croaking). The medium-heavy difficulty means gaps in your two-pointer or sorting technique will cost you. Breadth-first search appears once (Rotting Oranges), so don't waste 10 hours on graph theory when you should be drilling array traversal first. The good news: no hard problems reported. The catch: mediums at Zoox move fast and expect clean implementations. StealthCoder is your hedge if you hit a medium you haven't prepped and can't recall the exact approach.
Companies with similar patterns
If you prepped for Zoox, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Zoox.
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.
Zoox interview FAQ
How many array problems should I solve before the Zoox assessment?+
At least 10 to 12, since arrays represent 5 of the 9 reported problems here. Focus on variants of Best Time to Buy and Sell Stock and 4Sum first, since those patterns repeat. Two-pointers and sorting are baked into most of them, so don't treat those as separate topics.
Is dynamic programming a big deal for Zoox?+
Lower frequency, but it shows up. Fibonacci Number and Best Time to Buy and Sell Stock both use it. Know memoization cold because DP problems often fail on recursion depth or repeated calculations. But don't prioritize DP above arrays and two-pointers.
What should I drill first if I have three days?+
Day one: array manipulation with two-pointers (4Sum, String Compression). Day two: sorting, counting, and breadth-first search (Rotting Oranges, H-Index). Day three: string parsing and math (Minimum Number of Frogs Croaking, Basic Calculator II). All mediums; no hard problems reported.
Will I see linked list or queue design at Zoox?+
Design Circular Queue is reported, but it's the only design-pattern problem. It's a medium, not a system-design interview. Know how to implement a queue with arrays, but don't spend days on it if array problems are shaky.
Is there anything I can skip?+
Recursion and memoization are tied to one problem (Fibonacci). Know the concept, but if you're tight on time, solve Fibonacci iteratively first. Stack appears once in Basic Calculator II. Don't skip it, but it's not a core pattern here like two-pointers and sorting are.