Practice problems across 75+ categories
Practice problems frequently asked at Graph • 169 problems | 3 Easy | 79 Medium | 85 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 136 | Minimum Weighted Subgraph With the Required Paths | Hard | GraphShortest Path |
| 137 | Modify Graph Edge Weights | Hard | GraphHeap (Priority Queue)Shortest Path |
| 138 | Most Profitable Path in a Tree | Medium | ArrayTreeDepth-First Search |
| 139 | Most Stones Removed with Same Row or Column | Medium | Hash TableDepth-First SearchUnion Find |
| 140 | Network Cable Cost | Medium | GraphMSTKruskal |
| 141 | Network Delay Time | Medium | Depth-First SearchBreadth-First SearchGraph |
| 142 | Node With Highest Edge Score | Medium | Hash TableGraph |
| 143 | Number of Connected Components in an Undirected Graph | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 144 | Number of Good Paths | Hard | ArrayHash TableTree |
| 145 | Number of Increasing Paths in a Grid | Hard | ArrayDynamic ProgrammingDepth-First Search |
| 146 | Number of Operations to Make Network Connected | Medium | Depth-First SearchBreadth-First SearchUnion Find |
| 147 | Number of Possible Sets of Closing Branches | Hard | Bit ManipulationGraphHeap (Priority Queue) |
| 148 | Number of Provinces | Unknown | Depth-First SearchBreadth-First SearchUnion Find |
| 149 | Number of Restricted Paths From First to Last Node | Medium | Dynamic ProgrammingGraphTopological Sort |
| 150 | Number of Ways to Arrive at Destination | Medium | Dynamic ProgrammingGraphTopological Sort |
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.
