Practice problems across 75+ categories
Practice problems frequently asked at Graph • 169 problems | 3 Easy | 79 Medium | 85 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 121 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Dynamic ProgrammingDepth-First SearchBreadth-First Search |
| 122 | Minimum Edge Weight Equilibrium Queries in a Tree | Hard | ArrayTreeGraph |
| 123 | Minimum Fuel Cost to Report to the Capital | Medium | TreeDepth-First SearchBreadth-First Search |
| 124 | Minimum Height Trees | Medium | Depth-First SearchBreadth-First SearchGraph |
| 125 | Minimum Number of Vertices to Reach All Nodes | Medium | Graph |
| 126 | Minimum Obstacle Removal to Reach Corner | Hard | ArrayBreadth-First SearchGraph |
| 127 | Minimum Operations to Remove Adjacent Ones in Matrix | Hard | ArrayGraphMatrix |
| 128 | Minimum Path Cost in a Hidden Grid | Medium | ArrayDepth-First SearchBreadth-First Search |
| 129 | Minimum Runes to Add to Cast Spell | Hard | ArrayDepth-First SearchBreadth-First Search |
| 130 | Minimum Score of a Path Between Two Cities | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 131 | Minimum Spanning Tree | Medium | GraphsGraphGreedy |
| 132 | Minimum Time to Break Locks II | Hard | ArrayDepth-First SearchGraph |
| 133 | Minimum Time to Transport All Individuals | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 134 | Minimum Time to Visit a Cell In a Grid | Hard | ArrayBreadth-First SearchGraph |
| 135 | Minimum Time to Visit Disappearing Nodes | Medium | ArrayGraphHeap (Priority Queue) |
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.
