Skip to content
Avio Lines
D17

Graphs

145 stations · 75h

BFS, DFS, topological sort, shortest paths and MST. 19 concept lectures and 126 interview problems explained by codestorywithMIK (75h of video), grouped into 9 patterns such as BFS, DFS, Topological Sort.

Start this line →
problems by zone (pattern)
  • BFS58
  • DFS57
  • Topological Sort16
  • Shortest Path (Dijkstra/Bellman/Floyd)32
  • MST6
  • DSU12
  • Bipartite3
  • Cycle Detection4
  • Bridges/Articulation1
  1. Graph Concepts & Qns - 1 : Graph will no more be a Nightmare 😴😱🤯7:21
  2. Graph Concepts & Qns - 2 : Graph Representations 😴😱🤯19:21
  3. Graph Concepts & Qns - 3 : DFS & BFS24:48
  4. Graph Concepts & Qns - 5 (Microsoft, Amazon, Flipkart.) : Detect Cycle in Undirected Graph using BFS15:28
  5. Graph Concepts & Qns - 623:13
  6. Graph Concepts & Qns - 7 (Microsoft, Accolite, Amazon, Flipkart) : Topological Sort using DFS26:05
  7. Graph Concepts & Qns - 824:36
  8. Graph Concepts & Qns - 9 (Flipkart, Amazon, Microsoft...) : Detect Cycle in Directed Graph using BFS11:47
  9. Disjoint Set Union30:12
  10. Disjoint Set Union By Rank and Path Compression22:09
  11. Satisfiability of Equality Equations - (GOOGLE)20:08
  12. Number of Operations to Make Network Connected - (AMAZON)20:28
  13. Minimum Spanning Tree9:01
    Easy
  14. Disjoint Set Union By SIZE and Path Compression17:08
  15. Euler Path33:23
  16. Euler Path23:30
  17. Euler Path17:43
  18. Multi-Source BFS31:04
  19. 0-1 BFS35:18

All 145 stations in order

  1. 1.Graph Concepts & Qns - 1 : Graph will no more be a Nightmare 😴😱🤯
  2. 2.Graph Concepts & Qns - 2 : Graph Representations 😴😱🤯
  3. 3.Graph Concepts & Qns - 3 : DFS & BFS
  4. 4.Graph Concepts & Qns - 5 (Microsoft, Amazon, Flipkart.) : Detect Cycle in Undirected Graph using BFS
  5. 5.Graph Concepts & Qns - 6
  6. 6.Graph Concepts & Qns - 7 (Microsoft, Accolite, Amazon, Flipkart) : Topological Sort using DFS
  7. 7.Graph Concepts & Qns - 8
  8. 8.Graph Concepts & Qns - 9 (Flipkart, Amazon, Microsoft...) : Detect Cycle in Directed Graph using BFS
  9. 9.Disjoint Set Union
  10. 10.Disjoint Set Union By Rank and Path Compression
  11. 11.Satisfiability of Equality Equations - (GOOGLE)
  12. 12.Number of Operations to Make Network Connected - (AMAZON)
  13. 13.Minimum Spanning Tree
  14. 14.Disjoint Set Union By SIZE and Path Compression
  15. 15.Euler Path
  16. 16.Euler Path
  17. 17.Euler Path
  18. 18.Multi-Source BFS
  19. 19.0-1 BFS
  20. 20.Graph Concepts & Qns - 4 (Microsoft, Amazon, Flipkart) : Detect Cycle in Undirected Graph using DFS
  21. 21.Number of Provinces - (Google, Microsoft ) (LeetCode 547)
  22. 22.Number of Provinces - (Google, Microsoft,Amazon) (LeetCode 547)
  23. 23.Course Schedule (LeetCode 207)
  24. 24.Course Schedule-II (LeetCode 210)
  25. 25.Course Schedule (LeetCode 207)
  26. 26.Course Schedule-II (LeetCode 210)
  27. 27.Is Graph Bipartite ? (LeetCode 785)
  28. 28.Is Graph Bipartite ? (LeetCode 785)
  29. 29.Detect Cycle using DSU - (Google, Microsoft)
  30. 30.Count Unreachable Pairs of Nodes in an Undirected Graph (LeetCode 2316)
  31. 31.Dijkstra's Algorithm
  32. 32.Dijkstra's Algorithm
  33. 33.Dijkstra's Algorithm
  34. 34.Shortest Path in Weighted undirected graph
  35. 35.Network Delay Time (LeetCode 743)
  36. 36.Shortest Path in Binary Matrix (LeetCode 1091)
  37. 37.Path With Minimum Effort (LeetCode 1631)
  38. 38.Bellman-Ford Algorithm
  39. 39.Floyd Warshall Algorithm
  40. 40.Prim's Algorithm
  41. 41.Min Cost to Connect All Points (LeetCode 1584)
  42. 42.Kruskal's Algorithm
  43. 43.Min Cost to Connect All Points (LeetCode 1584)
  44. 44.Strongly Connected Components
  45. 45.Hierholzer's Algorithm (LeetCode 2097)
  46. 46.Diameter Of Undirected Graph (LeetCode 1245)
  47. 47.Find Minimum Diameter After Merging Two Trees (LeetCode 3203)
  48. 48.Rotting Oranges (LeetCode 994)
  49. 49.Map of Highest Peak (LeetCode 1765)
  50. 50.Find a Safe Walk Through a Grid (LeetCode 3286)
  51. 51.Minimum Genetic Mutation -(Asked by Twitter) : Explanation ➕ Live Coding (LeetCode 433)
  52. 52.Most Stones Removed with Same Row or Column (LeetCode 947)
  53. 53.Nearest Exit from Entrance in Maze -(Samsung) : Explanation ➕ Live Coding (LeetCode 1926)
  54. 54.Find if Path Exists in Graph (LeetCode 1971)
  55. 55.Keys and Rooms - (GOOGLE) : Explanation ➕ Live Coding 👩🏻‍💻🧑🏻‍💻🤯😱 (LeetCode 841)
  56. 56.Possible Bipartition - (Microsoft, Flipkart, Samsung) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻 (LeetCode 886)
  57. 57.Sum of Distances in Tree (LeetCode 834)
  58. 58.All Paths From Source to Target - (Amazon, Microsoft) : Explanation ➕ Live Coding (LeetCode 797)
  59. 59.Minimum Time to Collect All Apples in a Tree - (Microsoft) : Explanation ➕ Live Coding (LeetCode 1443)
  60. 60.Number of Nodes in the Sub-Tree With the Same Label : (Better Approach) (LeetCode 1519)
  61. 61.Longest Path With Different Adjacent Characters : (Microsoft) (LeetCode 2246)
  62. 62.Lexicographically Smallest Equivalent String (LeetCode 1061)
  63. 63.Number of Good Paths (LeetCode 2421)
  64. 64.Find Closest Node to Given Two Nodes (LeetCode 2359)
  65. 65.Cheapest Flights Within K Stops (LeetCode 787)
  66. 66.Minimum Score of a Path Between Two Cities (LeetCode 2492)
  67. 67.Reorder Routes to Make All Paths Lead to the City Zero (LeetCode 1466)
  68. 68.Count Unreachable Pairs of Nodes in an Undirected Graph (LeetCode 2316)
  69. 69.Longest Cycle in a Graph (LeetCode 2360)
  70. 70.Clone Graph (LeetCode 133)
  71. 71.Largest Color Value in a Directed Graph (LeetCode 1857)
  72. 72.Similar String Groups (LeetCode 839)
  73. 73.Similar String Groups (LeetCode 839)
  74. 74.Checking Existence of Edge Length Limited Paths (LeetCode 1697)
  75. 75.Remove Max Number Of Edges To Keep Graph Fully Traversable (LeetCode 1579)
  76. 76.Minimum Number of Vertices to Reach All Nodes (LeetCode 1557)
  77. 77.Evaluate Division (LeetCode 399)
  78. 78.Shortest Path in Binary Matrix (LeetCode 1091)
  79. 79.Detonate the Maximum Bombs (LeetCode 2101)
  80. 80.Path with Maximum Probability (LeetCode 1514)
  81. 81.Find Eventual Safe States (LeetCode 802)
  82. 82.Maximal Network Rank (LeetCode 1615)
  83. 83.Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (LeetCode 1489)
  84. 84.Sort Items by Groups Respecting Dependencies (LeetCode 1203)
  85. 85.Reconstruct Itinerary (LeetCode 332)
  86. 86.Shortest Path Visiting All Nodes (LeetCode 847)
  87. 87.Validate Binary Tree Nodes (LeetCode 1361)
  88. 88.Parallel Courses III (LeetCode 2050)
  89. 89.Design Graph With Shortest Path Calculator (LeetCode 2642)
  90. 90.Bus Routes (LeetCode 815)
  91. 91.Number of Possible Sets of Closing Branches (LeetCode 2959)
  92. 92.Minimum Cost to Convert String I (LeetCode 2976)
  93. 93.Count the Number of Houses at a Certain Distance I (LeetCode 3015)
  94. 94.Find All People With Secret (LeetCode 2092)
  95. 95.Minimum Cost Walk in Weighted Graph (LeetCode 3108)
  96. 96.Find Edges in Shortest Paths (LeetCode 3123)
  97. 97.Open the Lock (LeetCode 752)
  98. 98.Minimum Height Trees (LeetCode 310)
  99. 99.Freedom Trail (LeetCode 514)
  100. 100.Maximum Total Importance of Roads (LeetCode 2285)
  101. 101.All Ancestors of a Node in a Directed Acyclic Graph (LeetCode 2192)
  102. 102.Build a Matrix With Conditions (LeetCode 2392)
  103. 103.Find the City With the Smallest Number of Neighbors at a Threshold Distance (LeetCode 1334)
  104. 104.Second Minimum Time to Reach Destination (LeetCode 2045)
  105. 105.Most Stones Removed with Same Row or Column (LeetCode 947)
  106. 106.Modify Graph Edge Weights (LeetCode 2699)
  107. 107.Find Champion II (LeetCode 2924)
  108. 108.Shortest Distance After Road Addition Queries I (LeetCode 3243)
  109. 109.Minimum Obstacle Removal to Reach Corner I (LeetCode 2290)
  110. 110.Minimum Time to Visit a Cell In a Grid (LeetCode 2577)
  111. 111.Minimize the Maximum Edge Weight of Graph (LeetCode 3419)
  112. 112.Minimum Cost to Make at Least One Valid Path in a Grid (LeetCode 1368)
  113. 113.Course Schedule IV (LeetCode 1462)
  114. 114.Maximum Number of Fish in a Grid (LeetCode 2658)
  115. 115.Maximum Employees to Be Invited to a Meeting (LeetCode 2127)
  116. 116.Redundant Connection (LeetCode 684)
  117. 117.Divide Nodes Into the Maximum Number of Groups (LeetCode 2493)
  118. 118.Making A Large Island (LeetCode 827)
  119. 119.Most Profitable Path in a Tree (LeetCode 2467)
  120. 120.Find All Possible Recipes from Given Supplies (LeetCode 2115)
  121. 121.Count the Number of Complete Components (LeetCode 2685)
  122. 122.Number of Ways to Arrive at Destination (LeetCode 1976)
  123. 123.Find Minimum Time to Reach Last Room I (LeetCode 3341)
  124. 124.Find Minimum Time to Reach Last Room II (LeetCode 3342)
  125. 125.Maximize the Number of Target Nodes After Connecting Trees I (LeetCode 3372)
  126. 126.Maximize the Number of Target Nodes After Connecting Trees II (LeetCode 3373)
  127. 127.Maximum Candies You Can Get from Boxes (LeetCode 1298)
  128. 128.Minimum Score After Removals on a Tree (LeetCode 2322)
  129. 129.Swim in Rising Water (LeetCode 778)
  130. 130.Leetcode 1625 (LeetCode 1625)
  131. 131.Power Grid Maintenance (LeetCode 3607)
  132. 132.Power Grid Maintenance (LeetCode 3607)
  133. 133.Maximum Number of K-Divisible Components (LeetCode 2872)
  134. 134.Minimum Cost Path with Edge Reversals (LeetCode 3650)
  135. 135.Minimum Cost to Convert String II (LeetCode 2977)
  136. 136.Minimum Operations to Equalize Binary String (LeetCode 3666)
  137. 137.Maximize Spanning Tree Stability with Upgrades (LeetCode 3600)
  138. 138.Minimize Hamming Distance After Swap Operations (LeetCode 1722)
  139. 139.Detect Cycles in 2D Grid (LeetCode 1559)
  140. 140.Check if There is a Valid Path in a Grid (LeetCode 1391)
  141. 141.Minimum Jumps to Reach End via Prime Teleportation (LeetCode 3629)
  142. 142.Network Recovery Pathways (LeetCode 3620)
  143. 143.Path Existence Queries in a Graph I (LeetCode 3532)
  144. 144.Remove Methods From Project (LeetCode 3310)
  145. 145.Find Center of Star Graph (LeetCode 1791)