Skip to content

Topic 18 of 21

Graph Problems

BFS and DFS, cycle detection, topological sort, shortest paths with Dijkstra, Bellman-Ford and Floyd-Warshall, minimum spanning trees, disjoint sets and SCCs.

47 graph problems (2 easy, 12 medium, 33 hard) with LeetCode and GeeksforGeeks links.

Your progress

– / 47 solved

Easy
–/2
Medium
–/12
Hard
–/33
  1. Graph and TypesEasyGFG
  2. Graph RepresentationEasyGFG
  3. Connected ComponentsHardGFG
  4. DFSHardGFG
  5. BFSMediumGFG
  6. Number of ProvincesMediumLeetCodeGFG
  7. Rotten OrangesMediumLeetCodeGFG
  8. Flood FillHardLeetCodeGFG
  9. Cycle Detection in Undirected Graph (BFS)HardLeetCodeGFG
  10. 01 MatrixMediumLeetCodeGFG
  11. Surrounded RegionsHardLeetCodeGFG
  12. Number of EnclavesHardLeetCodeGFG
  13. Word Ladder - IHardLeetCodeGFG
  14. Word Ladder - IIHardLeetCodeGFG
  15. Number of Distinct IslandsHardLeetCodeGFG
  16. Bipartite GraphMediumLeetCodeGFG
  17. Cycle Detection in Directed GraphHardGFG
  18. Topo SortHardGFG
  19. Kahn's AlgoHardGFG
  20. Course Schedule IHardLeetCodeGFG
  21. Course Schedule IIHardLeetCode
  22. Find Eventual Safe StatesHardLeetCodeGFG
  23. Alien DictionaryHardGFG
  24. Shortest Path in UG with Unit WeightsHardGFG
  25. Shortest Path in DAGHardGFG
  26. Dijkstra's AlgorithmHardGFG
  27. Why Priority Queue Is Used in Dijkstra's AlgoMediumGFG
  28. Shortest Path in a Binary MazeMediumLeetCodeGFG
  29. Path with Minimum EffortMediumLeetCodeGFG
  30. Cheapest Flights Within K StopsHardLeetCodeGFG
  31. Network Delay TimeMediumLeetCodeGFG
  32. Number of Ways to Arrive at DestinationMediumLeetCodeGFG
  33. Minimum Steps to Reach End from Start by Performing Multiplication and Mod Operations with Array ElementsHardGFG
  34. Bellman Ford AlgorithmHardGFG
  35. Floyd Warshall AlgorithmHardGFG
  36. City with the Smallest Number of Neighbors at a Threshold DistanceHardLeetCodeGFG
  37. Minimum Spanning TreeHardGFG
  38. Disjoint Set UnionHardGFG
  39. Kruskal's AlgorithmHardGFG
  40. Number of Operations to Make Network ConnectedMediumLeetCodeGFG
  41. Most Stones Removed with Same Rows or ColumnsMediumLeetCodeGFG
  42. Accounts MergeHardLeetCodeGFG
  43. Making a Large IslandHardLeetCodeGFG
  44. Swim in Rising WaterHardLeetCode
  45. Bridges in GraphHardLeetCodeGFG
  46. Kosaraju's AlgorithmHardGFG
  47. Articulation PointHardGFG