How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Nuro interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
7 problems · 0 Easy, 4 Medium, 3 Hard · Ranked #199 of 458
0 Easy
0% · avg 23%
4 Medium
57% · avg 59%
3 Hard
43% · avg 18%
Based on 7 reported problems, Nuro interviews are significantly harder than average - 43% Hard vs 18% across all companies. The majority (57%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Nuro puts unusual emphasis on sliding-window (28.6% of problems, 6.1x the industry average), breadth-first-search (28.6% of problems, 3.4x the industry average), matrix (28.6% of problems, 3.2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (85.7%), matrix (28.6%), sliding-window (28.6%), string (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Subrectangle Queries Implement the class SubrectangleQueries which receives a rows x cols rectangle as a matrix of integers in the constructor and supports two methods: | Medium | Very Likely | arraydesignmatrix | Solve |
Maximum Number of Visible Points You are given an array points, an integer angle, and your location, where location = [posx, posy] and points[i] = [xi, yi] both denote integral coordinates on t... | Hard | Very Likely | arraymathgeometry | Solve |
Evaluate Division You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai /... | Medium | Likely | arraystringdepth-first-search | Solve |
Shortest Path in a Grid with Obstacles Elimination You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell... | Hard | Likely | arraybreadth-first-searchmatrix | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Likely | arrayqueuesliding-window | Solve |
Interleaving String Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2. | Medium | Likely | stringdynamic-programming | Solve |
Interval List Intersections You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of inte... | Medium | Likely | arraytwo-pointersline-sweep | Solve |
Subrectangle Queries
SolveImplement the class SubrectangleQueries which receives a rows x cols rectangle as a matrix of integers in the constructor and supports two methods:
Maximum Number of Visible Points
SolveYou are given an array points, an integer angle, and your location, where location = [posx, posy] and points[i] = [xi, yi] both denote integral coordinates on t...
Evaluate Division
SolveYou are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai /...
Shortest Path in a Grid with Obstacles Elimination
SolveYou are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell...
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Interleaving String
SolveGiven strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2.
Interval List Intersections
SolveYou are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of inte...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Nuro interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Nuro interviews focus heavily on array, matrix, sliding-window problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Nuro interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Nuro has been reported to ask 7 distinct coding problems. The most common topics are array, matrix, sliding-window. 0 are Easy difficulty, 4 are Medium, and 3 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, Nuro interviews are significantly harder than average - 43% Hard vs 18% across all companies. 57% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, matrix, sliding-window. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Nuro coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Nuro interview with AIarrow_forward