Practice problems across 75+ categories
Practice problems frequently asked at Graph • 169 problems | 3 Easy | 79 Medium | 85 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 166 | Reconstruct Itinerary | Hard | Depth-First SearchGraphEulerian Circuit |
| 167 | Redundant Connection | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 168 | Redundant Connection II | Hard | Depth-First SearchBreadth-First SearchUnion Find |
| 169 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | Union FindGraph |
| 170 | Remove Methods From Project | Medium | Depth-First SearchBreadth-First SearchGraph |
| 171 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Depth-First SearchBreadth-First SearchGraph |
| 172 | Satisfiability of Equality Equations | Medium | ArrayStringUnion Find |
| 173 | Second Minimum Time to Reach Destination | Hard | Breadth-First SearchGraphShortest Path |
| 174 | Sequence Reconstruction | Medium | ArrayGraphTopological Sort |
| 175 | Shortest Cycle in a Graph | Hard | Breadth-First SearchGraph |
| 176 | Shortest Distance After Road Addition Queries I | Medium | ArrayBreadth-First SearchGraph |
| 177 | Shortest Distance After Road Addition Queries II | Hard | ArrayGreedyGraph |
| 178 | Shortest Path (Dijkstra) | Medium | GraphsGraphPriority Queue |
| 179 | Shortest Path Visiting All Nodes | Hard | Dynamic ProgrammingBit ManipulationBreadth-First Search |
| 180 | Shortest Path with Alternating Colors | Medium | Breadth-First SearchGraph |
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.
