Skip to content

Topic: Graph

136 problems
#TitleStatusDifficulty
133Clone Graphread—Medium
207Course Scheduleread—Medium
210Course Schedule IIread—Medium
261Graph Valid Tree—Medium
269Alien Dictionary—Hard
310Minimum Height Trees—Medium
323Number of Connected Components in an Undirected Graphread—Medium
329Longest Increasing Path in a Matrix—Hard
332Reconstruct Itinerary—Hard
399Evaluate Divisionread—Medium
547Number of Provinces—Medium
684Redundant Connectionread—Medium
685Redundant Connection IIread—Hard
743Network Delay Timeread—Medium
753Cracking the Safe—Hard
765Couples Holding Handsread—Hard
785Is Graph Bipartite?read—Medium
787Cheapest Flights Within K Stopsread—Medium
797All Paths From Source to Target—Medium
802Find Eventual Safe Statesread—Medium
834Sum of Distances in Treeread—Hard
841Keys and Rooms—Medium
847Shortest Path Visiting All Nodes—Hard
851Loud and Richread—Medium
882Reachable Nodes In Subdivided Graphread—Hard
886Possible Bipartitionread—Medium
913Cat and Mouseread—Hard
924Minimize Malware Spreadread—Hard
928Minimize Malware Spread IIread—Hard
947Most Stones Removed with Same Row or Column—Medium
990Satisfiability of Equality Equations—Medium
997Find the Town Judgeread—Easy
1042Flower Planting With No Adjacentread—Medium
1129Shortest Path with Alternating Colorsread—Medium
1192Critical Connections in a Networkread—Hard
1203Sort Items by Groups Respecting Dependenciesread—Hard
1298Maximum Candies You Can Get from Boxes—Hard
1311Get Watched Videos by Your Friendsread—Medium
1319Number of Operations to Make Network Connectedread—Medium
1334Find the City With the Smallest Number of Neighbors at a Threshold Distanceread—Medium
1361Validate Binary Tree Nodesread—Medium
1368Minimum Cost to Make at Least One Valid Path in a Gridread—Hard
1377Frog Position After T Seconds—Hard
1462Course Schedule IVread—Medium
1466Reorder Routes to Make All Paths Lead to the City Zeroread—Medium
1489Find Critical and Pseudo-Critical Edges in Minimum Spanning Treeread—Hard
1494Parallel Courses IIread—Hard
1514Path with Maximum Probabilityread—Medium
1557Minimum Number of Vertices to Reach All Nodesread—Medium
1579Remove Max Number of Edges to Keep Graph Fully Traversableread—Hard
Page 1 of 3