Nuro LeetCode Questions
14 questions all-time · 0 easy · 11 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Maximum Number of Visible Points Array, Math, Geometry, Sliding Window, Sorting | Hard | 100 | 0.4% |
| 2 | Subrectangle Queries Array, Design, Matrix | Medium | 96 | 0.9% |
| 3 | Random Pick with Weight Array, Math, Binary Search, Prefix Sum, Randomized | Medium | 85 | 0.5% |
| 4 | Evaluate Division Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path | Medium | 76 | 0.6% |
| 5 | Interval List Intersections Array, Two Pointers, Sweep Line | Medium | 70 | 0.7% |
| 6 | Shortest Path in a Grid with Obstacles Elimination Array, Breadth-First Search, Matrix | Hard | 61 | 0.5% |
| 7 | Asteroid Collision Array, Stack, Simulation | Medium | 61 | 0.5% |
| 8 | Sparse Matrix Multiplication Array, Hash Table, Matrix | Medium | 61 | 0.7% |
| 9 | Merge Intervals Array, Sorting | Medium | 61 | 0.5% |
| 10 | Target Sum Array, Dynamic Programming, Backtracking | Medium | 61 | 0.5% |
| 11 | Alien Dictionary Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Hard | 61 | 0.4% |
| 12 | Remove Sub-Folders from the Filesystem Array, String, Depth-First Search, Trie | Medium | 61 | 0.8% |
| 13 | Minesweeper Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 61 | 0.7% |
| 14 | Dot Product of Two Sparse Vectors Array, Hash Table, Two Pointers, Design | Medium | 61 | 0.9% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.