Nuro coding interview
questions, leaked.
9 problems reported across recent Nuro interviews. Top patterns: array, math, sliding window. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Nuro's interview questions lean heavily on arrays and spatial reasoning. Out of 9 problems in the dataset, 8 touch arrays, and the hard problems stack geometry, grid traversal, and design challenges that demand both pattern recognition and implementation speed. One easy problem exists; the rest split 5 medium and 3 hard. You're looking at a filter where the company values engineers who can optimize for space and visibility constraints, not just brute force. If you blank on a sliding-window or BFS variation mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, so you don't lose points to panic.
Top problems at Nuro
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Subrectangle Queries | MEDIUM | 100.0 | 86% | Array · Design · Matrix |
| 02 | Maximum Number of Visible Points | HARD | 95.1 | 38% | Array · Math · Geometry |
| 03 | Evaluate Division | MEDIUM | 73.6 | 63% | Array · String · Depth-First Search |
| 04 | Shortest Path in a Grid with Obstacles Elimination | HARD | 73.6 | 46% | Array · Breadth-First Search · Matrix |
| 05 | Line Reflection | MEDIUM | 64.8 | 36% | Array · Hash Table · Math |
| 06 | Interleaving String | MEDIUM | 64.8 | 42% | String · Dynamic Programming |
| 07 | Moving Average from Data Stream | EASY | 64.8 | 80% | Array · Design · Queue |
| 08 | Interval List Intersections | MEDIUM | 64.8 | 73% | Array · Two Pointers · Line Sweep |
| 09 | Sliding Window Maximum | HARD | 64.8 | 48% | Array · Queue · Sliding Window |
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 Nuro 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- array8 · 89%
- math2 · 22%
- sliding window2 · 22%
- string2 · 22%
- breadth first search2 · 22%
- design2 · 22%
- matrix2 · 22%
- queue2 · 22%
- geometry1 · 11%
- sorting1 · 11%
Arrays dominate the Nuro interview loop, but they're rarely solo. Most problems bind arrays to geometry, design (stateful data structures), or graph traversal. Sliding Window Maximum and Maximum Number of Visible Points are the gatekeepers; both combine arrays with window or geometric constraints. The medium tier hits design patterns hard (Subrectangle Queries, Moving Average), so you need to think in terms of data-structure tradeoffs, not just algorithm chaining. Shortest Path in a Grid with Obstacles Elimination is the hard outlier that punishes incomplete BFS implementation. Geometry appears once but pairs with math and array logic, so don't isolate it. Start with the two sliding-window and queue problems, then nail the design questions. StealthCoder hedges the grid and geometry problems if your BFS or coordinate math doesn't surface immediately.
Companies with similar patterns
If you prepped for Nuro, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Nuro.
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.
Nuro interview FAQ
How many array problems should I drill before a Nuro interview?+
All of them. Eight out of nine problems touch arrays. But don't drill arrays in isolation. Focus on the variants that show up here: array-plus-design (Subrectangle, Moving Average), array-plus-geometry (visible points), and array-plus-BFS (grid shortest path). The array itself is the container; the algorithm is the skill.
Is sliding window necessary for Nuro?+
Yes. Two problems explicitly use it (Maximum Number of Visible Points, Sliding Window Maximum). The second is hard and requires monotonic queue optimization. Spend time on the queue-based window-max solution, not just the naive sliding approach. Know when to use deque, not just when to slide.
Should I study graph algorithms for Nuro?+
Yes, but only BFS and DFS. Evaluate Division introduces graph structure through equations, and Shortest Path in a Grid is a straight BFS problem. Union Find appears once. Master BFS on grids with obstacles; that's your hardest single problem and where most candidates lose time.
Are there design or system-design problems?+
No system design, but design-pattern questions appear frequently. Subrectangle Queries and Moving Average both demand you think about how to store and query data efficiently. You need to justify trade-offs between update and query time, not just code a solution.
What if I get stuck on geometry or math?+
Geometry appears once (Maximum Number of Visible Points), and math twice. If you blank on the angle-sorting or distance logic, you can't brute-force it in seconds. Drill the geometry problem early so you understand polar-coordinate sorting. If you still hit a wall on the live OA, that's what a real-time backup is for.