playlistduration

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

by take U forward · 56 videos

Total watch time

18h 15m

at 1× speed · exactly 18 hours, 15 minutes, 20 seconds at 1×

1×18h 15m 20s
1.25×14h 36m 16s
1.5×12h 10m 13s
1.75×10h 25m 54s
2×9h 7m 40s
Average video19m 34s
Longest42m 15s
Shortest6m 17s
Compare Open on YouTube JSON

Plan to finish

About 19 days at an hour a day

Pick a daily pace and the days you'll watch. Ticked videos are skipped.

Days

At one hour a day, every day, this playlist takes about 19 days. Turn on JavaScript to plan around your week.

Videos (56)

18h 15m in total · tick what you've watched

Tick videos you've watched — progress is saved in this browser.

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

Embed a badge

Show the watch time in a README or course description — it links back here and updates itself

Watch time: 18h 15m · 56 videos

Markdown
[![Watch time: 18h 15m · 56 videos](https://playlistduration.com/badge/playlist/PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn.svg)](https://playlistduration.com/playlist/PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn)
HTML
<a href="https://playlistduration.com/playlist/PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn"><img src="https://playlistduration.com/badge/playlist/PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn.svg" alt="Watch time: 18h 15m · 56 videos" width="210" height="20"></a>

Add ?speed=1.5 to the image URL for the time at that speed, ?label=Course to change the left text, or ?style=flat-square for square corners.

Want the numbers themselves? GET https://playlistduration.com/api/v1/playlist/PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn returns them as JSON — free, no key. API docs →

Data from the YouTube Data API as of 2026-09-22 (fresh). Private or deleted videos are excluded from totals.