Graph Series by Striver | C++ | Java | Interview Centric | Algorithms | Problems

Overview

Videos in this playlist 56

1. G-1. Introduction to Graph | Types | Different Conventions Used
2. G-2. Graph Representation in C++ | Two Ways to Represent
3. G-3. Graph Representation in Java | Two Ways to Represent
4. G-4. What are Connected Components ?
5. G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs
6. G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs
7. G-7. Number of Provinces | C++ | Java | Connected Components
8. G-8. Number of Islands | Number of Connected Components in Matrix | C++ | Java
9. G-9. Flood Fill Algorithm | C++ | Java
10. G-10. Rotten Oranges | C++ | Java
11. G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java
12. G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java
13. G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java
14. G-14. Surrounded Regions | Replace O's with X's | C++ | Java
15. G-15. Number of Enclaves | Multi-source BFS | C++ | Java
16. G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java
17. G-17. Bipartite Graph | BFS | C++ | Java
18. G-18. Bipartite Graph | DFS | C++ | Java
19. G-19. Detect cycle in a directed graph using DFS | Java | C++
20. G-20. Find Eventual Safe States - DFS
21. G-21. Topological Sort Algorithm | DFS
22. G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS
23. G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS
24. G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort
25. G-25. Find Eventual Safe States - BFS - Topological Sort
26. G-26. Alien Dictionary - Topological Sort
27. G-27. Shortest Path in Directed Acyclic Graph - Topological Sort
28. G-28. Shortest Path in Undirected Graph with Unit Weights
29. G-29. Word Ladder - I | Shortest Paths
30. G-30. Word Ladder - 2 | Shortest Paths
31. G-31. Word Ladder - 2 | Optimised Approach for Leetcode
32. G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1
33. G-33. Dijkstra's Algorithm - Using Set - Part 2
34. G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3
35. G-35. Print Shortest Path - Dijkstra's Algorithm
36. G-36. Shortest Distance in a Binary Maze
37. G-37. Path With Minimum Effort
38. G-38. Cheapest Flights Within K Stops
39. G-39. Minimum Multiplications to Reach End
40. G-40. Number of Ways to Arrive at Destination
41. G-41. Bellman Ford Algorithm
42. G-42. Floyd Warshall Algorithm
43. G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance
44. G-44. Minimum Spanning Tree - Theory
45. G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java
46. G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression
47. G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java
48. G-48. Number of Provinces - Disjoint Set
49. G-49. Number of Operations to Make Network Connected - DSU
50. G-50. Accounts Merge - DSU
51. G-51. Number of Islands - II - Online Queries - DSU
52. G-52. Making a Large Island - DSU
53. G-53. Most Stones Removed with Same Row or Column - DSU
54. G-54. Strongly Connected Components - Kosaraju's Algorithm
55. G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time
56. G-56. Articulation Point in Graph

Advantages and disadvantages

Some points apply to every course of this kind; see how we rank.