Nuro
13 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1610. Maximum Number of Visible Points | Hard | 100% | TopicsArrayMathGeometrySliding WindowSorting |
| 1476. Subrectangle Queries | Medium | 89.6% | TopicsArrayDesignMatrix |
| Random Pick with Weight | Medium | 86.8% | TopicsArrayMathBinary SearchPrefix SumRandomized |
| Evaluate Division | Medium | 74.8% | TopicsArrayStringDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryShortest PathBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| Minesweeper | Medium | 74.8% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 1293. Shortest Path in a Grid with Obstacles Elimination | Hard | 60% | TopicsArrayBreadth-First SearchMatrix |
| 986. Interval List Intersections | Medium | 60% | TopicsArrayTwo PointersSweep Line |
| Asteroid Collision | Medium | 60% | TopicsArrayStackSimulation |
| Sparse Matrix Multiplication | Medium | 60% | TopicsArrayHash TableMatrixLinear Algebra |
| 494. Target Sum | Medium | 60% | TopicsArrayDynamic ProgrammingBacktrackingKnapsack Problem0-1 Knapsack |
| Alien Dictionary | Hard | 60% | TopicsArrayStringDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 1233. Remove Sub-Folders from the Filesystem | Medium | 60% | TopicsArrayStringDepth-First SearchTrie |
| Dot Product of Two Sparse Vectors | Medium | 60% | TopicsArrayHash TableTwo PointersDesignLinear Algebra |
