Practice problems across 75+ categories
Practice problems frequently asked at Graph • 169 problems | 3 Easy | 79 Medium | 85 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 46 | Find Eventual Safe States | Medium | Depth-First SearchBreadth-First SearchGraph |
| 47 | Find if Path Exists in Graph | Easy | Depth-First SearchBreadth-First SearchUnion Find |
| 48 | Find Minimum Diameter After Merging Two Trees | Hard | TreeDepth-First SearchBreadth-First Search |
| 49 | Find Minimum Time to Reach Last Room I | Medium | ArrayGraphHeap (Priority Queue) |
| 50 | Find Minimum Time to Reach Last Room II | Medium | ArrayGraphHeap (Priority Queue) |
| 51 | Find Shortest Path with K Hops | Hard | GraphHeap (Priority Queue)Shortest Path |
| 52 | Find the Celebrity | Medium | Two PointersGraphInteractive |
| 53 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | Dynamic ProgrammingGraphShortest Path |
| 54 | Find the Closest Marked Node | Medium | ArrayGraphHeap (Priority Queue) |
| 55 | Find the Town Judge | Easy | ArrayHash TableGraph |
| 56 | Flower Planting With No Adjacent | Medium | Depth-First SearchBreadth-First SearchGraph |
| 57 | Frequencies of Shortest Supersequences | Hard | ArrayStringBit Manipulation |
| 58 | Frog Position After T Seconds | Hard | TreeDepth-First SearchBreadth-First Search |
| 59 | Get Watched Videos by Your Friends | Medium | ArrayHash TableBreadth-First Search |
| 60 | Graph Valid Tree | Medium | Depth-First SearchBreadth-First SearchUnion Find |
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.
