Skip to content

Topic: Graph

136 problems
TitleStatusDifficulty
Clone Graph—Medium
Course Schedule—Medium
Course Schedule II—Medium
Graph Valid Tree—Medium
Alien Dictionary—Hard
Minimum Height Trees—Medium
Number of Connected Components in an Undirected Graph—Medium
Longest Increasing Path in a Matrix—Hard
Reconstruct Itinerary—Hard
Evaluate Division—Medium
Number of Provinces—Medium
Redundant Connection—Medium
Redundant Connection IIread—Hard
Network Delay Time—Medium
Cracking the Safe—Hard
Couples Holding Hands—Hard
Is Graph Bipartite?—Medium
Cheapest Flights Within K Stops—Medium
All Paths From Source to Target—Medium
Find Eventual Safe States—Medium
Sum of Distances in Tree—Hard
Keys and Rooms—Medium
Shortest Path Visiting All Nodes—Hard
Loud and Rich—Medium
Reachable Nodes In Subdivided Graph—Hard
Possible Bipartition—Medium
Cat and Mouse—Hard
Minimize Malware Spreadread—Hard
Minimize Malware Spread II—Hard
Most Stones Removed with Same Row or Column—Medium
Satisfiability of Equality Equations—Medium
Find the Town Judge—Easy
Flower Planting With No Adjacent—Medium
Shortest Path with Alternating Colors—Medium
Critical Connections in a Network—Hard
Sort Items by Groups Respecting Dependencies—Hard
Maximum Candies You Can Get from Boxes—Hard
Get Watched Videos by Your Friends—Medium
Number of Operations to Make Network Connected—Medium
Find the City With the Smallest Number of Neighbors at a Threshold Distanceread—Medium
Validate Binary Tree Nodes—Medium
Minimum Cost to Make at Least One Valid Path in a Grid—Hard
Frog Position After T Seconds—Hard
Course Schedule IV—Medium
Reorder Routes to Make All Paths Lead to the City Zero—Medium
Find Critical and Pseudo-Critical Edges in Minimum Spanning Treeread—Hard
Parallel Courses II—Hard
Path with Maximum Probability—Medium
Minimum Number of Vertices to Reach All Nodes—Medium
Remove Max Number of Edges to Keep Graph Fully Traversable—Hard
Page 1 of 3