Practice problems across 75+ categories
Practice problems frequently asked at Graph • 169 problems | 3 Easy | 79 Medium | 85 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 136 | Parallel Courses III | Hard | ArrayDynamic ProgrammingGraph |
| 137 | Path Existence Queries in a Graph I | Medium | ArrayHash TableBinary Search |
| 138 | Path Existence Queries in a Graph II | Hard | ArrayTwo PointersBinary Search |
| 139 | Path with Maximum Probability | Medium | ArrayGraphHeap (Priority Queue) |
| 140 | Paths in Maze That Lead to Same Room | Medium | Graph |
| 141 | Possible Bipartition | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 142 | Process Restricted Friend Requests | Hard | Union FindGraph |
| 143 | Properties Graph | Medium | ArrayHash TableDepth-First Search |
| 144 | Rank Transform of a Matrix | Hard | ArrayUnion FindGraph |
| 145 | Reachable Nodes In Subdivided Graph | Hard | GraphHeap (Priority Queue)Shortest Path |
| 146 | Reachable Nodes With Restrictions | Medium | ArrayHash TableTree |
| 147 | Reconstruct Itinerary | Hard | Depth-First SearchGraphEulerian Circuit |
| 148 | Redundant Connection | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 149 | Redundant Connection II | Hard | Depth-First SearchBreadth-First SearchUnion Find |
| 150 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | Union FindGraph |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
