14 curated coding interview questions directly asked in Nuro technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 529 | Minesweeper | Medium | Core DSA | Implementation / Reasoning | 68.8% | 100.0% | 3m |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 100.0% | 6m |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | Core DSA | Implementation / Reasoning | 78.6% | 100.0% | 6m |
| 1476 | Subrectangle Queries | Medium | Core DSA | Implementation / Reasoning | 86.4% | 100.0% | all |
| 1610 | Maximum Number of Visible Points | Hard | Arrays | Sorting / Prefix / Scan | 38.2% | 100.0% | all |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 75.0% | all |
| 986 | Interval List Intersections | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 73.0% | 75.0% | all |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | Trees | DFS / BFS | 46.3% | 62.5% | all |
| 97 | Interleaving String | Medium | Strings | Hashing / Sliding Window | 44.0% | 62.5% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 62.5% | all |
| 311 | Sparse Matrix Multiplication | Medium | Arrays | Sorting / Prefix / Scan | 69.3% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 494 | Target Sum | Medium | Arrays | Sorting / Prefix / Scan | 52.2% | 62.5% | all |
| 269 | Alien Dictionary | Hard | Graphs | BFS / DFS / Topological Sort | 37.2% | 62.5% | all |