Graph Problems

141 Graph LeetCode problems · Solve with AI-powered hints & step-by-step explanations.

Learn the coding interview patterns behind these problems, including Graph interview patterns.

Start with these

133 Clone Graph Medium 207 Course Schedule Medium 210 Course Schedule II Medium 2421 Number of Good Paths Hard 3615 Longest Palindromic Path in Graph Hard

All Graph problems

133 Clone Graph Medium 207 Course Schedule Medium 210 Course Schedule II Medium 310 Minimum Height Trees Medium 329 Longest Increasing Path in a Matrix Hard 332 Reconstruct Itinerary Hard 399 Evaluate Division Medium 547 Number of Provinces Medium 684 Redundant Connection Medium 685 Redundant Connection II Hard 743 Network Delay Time Medium 753 Cracking the Safe Hard 765 Couples Holding Hands Hard 785 Is Graph Bipartite? Medium 787 Cheapest Flights Within K Stops Medium 797 All Paths From Source to Target Medium 802 Find Eventual Safe States Medium 834 Sum of Distances in Tree Hard 841 Keys and Rooms Medium 847 Shortest Path Visiting All Nodes Hard 851 Loud and Rich Medium 882 Reachable Nodes In Subdivided Graph Hard 886 Possible Bipartition Medium 913 Cat and Mouse Hard 924 Minimize Malware Spread Hard 928 Minimize Malware Spread II Hard 947 Most Stones Removed with Same Row or Column Medium 990 Satisfiability of Equality Equations Medium 997 Find the Town Judge Easy 1042 Flower Planting With No Adjacent Medium 1129 Shortest Path with Alternating Colors Medium 1192 Critical Connections in a Network Hard 1203 Sort Items by Groups Respecting Dependencies Hard 1298 Maximum Candies You Can Get from Boxes Hard 1311 Get Watched Videos by Your Friends Medium 1319 Number of Operations to Make Network Connected Medium 1334 Find the City With the Smallest Number of Neighbors at a Threshold Distance Medium 1361 Validate Binary Tree Nodes Medium 1368 Minimum Cost to Make at Least One Valid Path in a Grid Hard 1377 Frog Position After T Seconds Hard 1462 Course Schedule IV Medium 1466 Reorder Routes to Make All Paths Lead to the City Zero Medium 1489 Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree Hard 1494 Parallel Courses II Hard 1514 Path with Maximum Probability Medium 1557 Minimum Number of Vertices to Reach All Nodes Medium 1579 Remove Max Number of Edges to Keep Graph Fully Traversable Hard 1584 Min Cost to Connect All Points Medium 1591 Strange Printer II Hard 1615 Maximal Network Rank Medium 1632 Rank Transform of a Matrix Hard 1697 Checking Existence of Edge Length Limited Paths Hard 1719 Number Of Ways To Reconstruct A Tree Hard 1728 Cat and Mouse II Hard 1761 Minimum Degree of a Connected Trio in a Graph Hard 1782 Count Pairs Of Nodes Hard 1786 Number of Restricted Paths From First to Last Node Medium 1791 Find Center of Star Graph Easy 1857 Largest Color Value in a Directed Graph Hard 1916 Count Ways to Build Rooms in an Ant Colony Hard 1928 Minimum Cost to Reach Destination in Time Hard 1971 Find if Path Exists in Graph Easy 1976 Number of Ways to Arrive at Destination Medium 2039 The Time When the Network Becomes Idle Medium 2045 Second Minimum Time to Reach Destination Hard 2050 Parallel Courses III Hard 2065 Maximum Path Quality of a Graph Hard 2076 Process Restricted Friend Requests Hard 2092 Find All People With Secret Hard 2097 Valid Arrangement of Pairs Hard 2101 Detonate the Maximum Bombs Medium 2115 Find All Possible Recipes from Given Supplies Medium 2127 Maximum Employees to Be Invited to a Meeting Hard 2192 All Ancestors of a Node in a Directed Acyclic Graph Medium 2203 Minimum Weighted Subgraph With the Required Paths Hard 2242 Maximum Score of a Node Sequence Hard 2246 Longest Path With Different Adjacent Characters Hard 2285 Maximum Total Importance of Roads Medium 2290 Minimum Obstacle Removal to Reach Corner Hard 2316 Count Unreachable Pairs of Nodes in an Undirected Graph Medium 2328 Number of Increasing Paths in a Grid Hard 2359 Find Closest Node to Given Two Nodes Medium 2360 Longest Cycle in a Graph Hard 2368 Reachable Nodes With Restrictions Medium 2374 Node With Highest Edge Score Medium 2392 Build a Matrix With Conditions Hard 2421 Number of Good Paths Hard 2467 Most Profitable Path in a Tree Medium 2477 Minimum Fuel Cost to Report to the Capital Medium 2492 Minimum Score of a Path Between Two Cities Medium 2493 Divide Nodes Into the Maximum Number of Groups Hard 2497 Maximum Star Sum of a Graph Medium 2508 Add Edges to Make Degrees of All Nodes Even Hard 2577 Minimum Time to Visit a Cell In a Grid Hard 2603 Collect Coins in a Tree Hard 2608 Shortest Cycle in a Graph Hard 2642 Design Graph With Shortest Path Calculator Hard 2646 Minimize the Total Price of the Trips Hard 2662 Minimum Cost of a Path With Special Roads Medium 2685 Count the Number of Complete Components Medium 2699 Modify Graph Edge Weights Hard 2846 Minimum Edge Weight Equilibrium Queries in a Tree Hard 2858 Minimum Edge Reversals So Every Node Is Reachable Hard 2876 Count Visited Nodes in a Directed Graph Hard 2924 Find Champion II Medium 2959 Number of Possible Sets of Closing Branches Hard 2976 Minimum Cost to Convert String I Medium 2977 Minimum Cost to Convert String II Hard 3015 Count the Number of Houses at a Certain Distance I Medium 3017 Count the Number of Houses at a Certain Distance II Hard 3108 Minimum Cost Walk in Weighted Graph Hard 3112 Minimum Time to Visit Disappearing Nodes Medium 3123 Find Edges in Shortest Paths Hard 3203 Find Minimum Diameter After Merging Two Trees Hard 3241 Time Taken to Mark All Nodes Hard 3243 Shortest Distance After Road Addition Queries I Medium 3244 Shortest Distance After Road Addition Queries II Hard 3286 Find a Safe Walk Through a Grid Medium 3310 Remove Methods From Project Medium 3311 Construct 2D Grid Matching Graph Layout Hard 3341 Find Minimum Time to Reach Last Room I Medium 3342 Find Minimum Time to Reach Last Room II Medium 3377 Digit Operations to Make Two Integers Equal Medium 3387 Maximize Amount After Two Days of Conversions Medium 3419 Minimize the Maximum Edge Weight of Graph Medium 3435 Frequencies of Shortest Supersequences Hard 3493 Properties Graph Medium 3528 Unit Conversion I Medium 3530 Maximum Profit from Valid Topological Order in DAG Hard 3532 Path Existence Queries in a Graph I Medium 3534 Path Existence Queries in a Graph II Hard 3543 Maximum Weighted K-Edge Path Medium 3547 Maximum Sum of Edge Values in a Graph Hard 3594 Minimum Time to Transport All Individuals Hard 3600 Maximize Spanning Tree Stability with Upgrades Hard 3604 Minimum Time to Reach Destination in Directed Graph Medium 3607 Power Grid Maintenance Medium 3608 Minimum Time for K Connected Components Medium 3613 Minimize Maximum Component Cost Medium 3615 Longest Palindromic Path in Graph Hard 3620 Network Recovery Pathways Hard

← Browse all LeetCode problems