GetFreeCourses Co-Udemy-Graph Theory Algorithms for Competitive Programming 2022

1. 01 - Introduction/001 Course Orientation!.mp498.19MB
2. 02 - Setting Up Sublime [optional]/001 Sublime Setup.mp432.92MB
3. 02 - Setting Up Sublime [optional]/002 Adding Master Header File.mp432MB
4. 02 - Setting Up Sublime [optional]/003 Escaping Online Judges.mp418.3MB
5. 02 - Setting Up Sublime [optional]/004 Common Code Snippets.mp413.3MB
6. 02 - Setting Up Sublime [optional]/005 Using Macros.mp426.81MB
7. 02 - Setting Up Sublime [optional]/006 Example Code Explained.mp4149.84MB
8. 03 - Graph Representation/001 Graphs Introduction.mp4140.65MB
9. 03 - Graph Representation/002 Graph Applications.mp417.93MB
10. 03 - Graph Representation/003 Graph Key Terms.mp419.99MB
11. 03 - Graph Representation/004 Adjacency List Representation.mp416.57MB
12. 03 - Graph Representation/005 Adjacency List Representation with Node Class.mp426.88MB
13. 04 - Breath First Search/001 Breadth First Search.mp415.38MB
14. 04 - Breath First Search/002 BFS Code.mp466.16MB
15. 04 - Breath First Search/003 BFS Shortest Path.mp49.69MB
16. 04 - Breath First Search/004 BFS Shortest Path Code.mp418.4MB
17. 04 - Breath First Search/005 Snakes and Ladder Solution.mp4101.13MB
18. 05 - Depth First Search/001 DFS Concept.mp49.56MB
19. 05 - Depth First Search/002 DFS Code.mp416.85MB
20. 05 - Depth First Search/003 Largest Island Solution.mp447.15MB
21. 06 - Cycle Detection/001 Cycle Detection in Undirected Graph.mp49.04MB
22. 06 - Cycle Detection/002 Cycle Detection in Undirected Graph Code.mp426.67MB
23. 06 - Cycle Detection/003 Directed Graph - Cycle Detection.mp422.15MB
24. 06 - Cycle Detection/004 Directed Graph - Cycle Detection Code.mp432.86MB
25. 06 - Cycle Detection/005 Bipartite Graph.mp413.86MB
26. 06 - Cycle Detection/006 Bipartite Graph Code.mp433.1MB
27. 07 - Directed Acyclic Graph/001 Directed Acyclic Graph & Topological Ordering.mp417.99MB
28. 07 - Directed Acyclic Graph/002 Topological Sort Algorithm.mp411.05MB
29. 07 - Directed Acyclic Graph/003 Topological Ordering BFS Code.mp412.85MB
30. 07 - Directed Acyclic Graph/004 Toplogical Order using DFS.mp453.5MB
31. 07 - Directed Acyclic Graph/005 Topological Ordering using DFS Code.mp413.9MB
32. 08 - Disjoint Set Union/001 Disjoint Set Union Introduction.mp410.24MB
33. 08 - Disjoint Set Union/002 DSU Data Structure - Union & Find Ops.mp418.98MB
34. 08 - Disjoint Set Union/003 DSU Data Structure.mp415.07MB
35. 08 - Disjoint Set Union/004 DSU Implementation.mp432MB
36. 08 - Disjoint Set Union/005 Union by Rank.mp430.67MB
37. 08 - Disjoint Set Union/006 Path Compression Optimisation.mp422.54MB
38. 08 - Disjoint Set Union/007 DSU Dry Run.mp440.49MB
39. 09 - Minimum Spanning Trees/001 Introduction to Minimum Spanning Trees!.mp431.46MB
40. 09 - Minimum Spanning Trees/002 Prim's Algorithm.mp435.55MB
41. 09 - Minimum Spanning Trees/003 Prim's Code.mp457.48MB
42. 09 - Minimum Spanning Trees/004 Kruskal's Algorithm.mp418.11MB
43. 09 - Minimum Spanning Trees/005 Kruskal's Code.mp433.58MB
44. 10 - Shortest Path Algorithms/001 Introduction to Shortest Path Algorithms.mp418.94MB
45. 10 - Shortest Path Algorithms/002 Dijkshtra's Algorithm.mp496.14MB
46. 10 - Shortest Path Algorithms/003 Dijkshtra's Algorithm Code.mp446.58MB
47. 10 - Shortest Path Algorithms/004 Bellman Ford Algorithm.mp462.43MB
48. 10 - Shortest Path Algorithms/005 Bellman Ford Code.mp416.15MB
49. 10 - Shortest Path Algorithms/006 Floyd Warshall.mp4221.95MB
50. 10 - Shortest Path Algorithms/007 Floyd Warshall Code.mp425.61MB
51. 10 - Shortest Path Algorithms/008 Solution - Shortest Path in Grid!.mp438.16MB
52. 11 - Travelling Salesman Problem/001 Travelling Salesman Problem.mp434.78MB
53. 11 - Travelling Salesman Problem/002 Travelling Salesman Intution.mp411.03MB
54. 11 - Travelling Salesman Problem/003 TSP Brute Force.mp439.93MB
55. 11 - Travelling Salesman Problem/004 TSP DP + Bitmasking.mp49.32MB
56. 12 - Flood Fill/001 Flood Fill Introduction.mp440.52MB
57. 12 - Flood Fill/002 Number of Islands.mp4195.45MB
58. 12 - Flood Fill/003 Coloring Islands.mp425.27MB
59. 12 - Flood Fill/004 Biggest Island.mp415.95MB
60. 12 - Flood Fill/005 Make Largest island.mp4174.8MB
61. 13 - Multi - Source BFS/001 Introduction to Multi Source BFS.mp479.21MB
62. 13 - Multi - Source BFS/002 Problem on Multi Source BFS.mp4190.56MB
63. 13 - Multi - Source BFS/003 Bonus Problem on Multi Source BFS.mp4105.21MB
64. 13 - Multi - Source BFS/004 01 BFS.mp448.54MB
65. 14 - DFS-Tree and Backedges/001 Introduction to DFS tree and Backedges.mp430.69MB
66. 14 - DFS-Tree and Backedges/002 DFS Tree and backedges in Undirected graph.mp4103.49MB
67. 14 - DFS-Tree and Backedges/003 DFS Tree and Backedges in Directed and Undirectde graphs.mp4213.67MB
68. 14 - DFS-Tree and Backedges/004 Print cycle in a graph.mp472.32MB
69. 15 - Articulation Points & Bridges/001 Introduction and definitions.mp452.3MB
70. 15 - Articulation Points & Bridges/002 Discovered Time.mp470.27MB
71. 15 - Articulation Points & Bridges/003 Lowest Time or Low Link.mp4205.1MB
72. 15 - Articulation Points & Bridges/004 Algorithm.mp4105.49MB
73. 15 - Articulation Points & Bridges/005 Coding the Algorithm.mp4147.1MB
74. 16 - Strongly Connected Components/001 Introduction to Topological Order and Strongly Connected Components.mp4110.64MB
75. 16 - Strongly Connected Components/002 Algorithm and Code to find Topological Ordering.mp4118.82MB
76. 16 - Strongly Connected Components/003 Introduction to Strongly Connected Component.mp459.1MB
77. 16 - Strongly Connected Components/004 Condensed Component Graph.mp436.85MB
78. 16 - Strongly Connected Components/005 Kosaraju Algorithm for Strongly Connected Component.mp4202.63MB
79. 16 - Strongly Connected Components/006 Kosaraju Algorithm for Strongly Connected Component Code.mp491.2MB
80. 17 - Trees/001 Introduction and properties of trees.mp4237.7MB
81. 17 - Trees/002 DFS on trees.mp430.47MB
82. 17 - Trees/003 Print all ancestors in a tree.mp4103.35MB
83. 18 - Euler Tour/001 Introduction.mp489.29MB
84. 18 - Euler Tour/002 Applications.mp4290.49MB
85. 18 - Euler Tour/003 Code.mp437.8MB
86. 19 - LCA/001 Introduction.mp499.65MB
87. 19 - LCA/002 LCA (Brute Force).mp477.1MB
88. 19 - LCA/003 LCA using Binary Lifting.mp4396.55MB
89. 20 - Re-rooting of trees/001 Introduction and brute force.mp4120.96MB
90. 20 - Re-rooting of trees/002 Approach to re root the tree.mp4233.97MB
91. 20 - Re-rooting of trees/003 Code for re rooting of the tree.mp488.45MB
92. 21 - Dynamic Programming On Trees/001 DP introduction.mp425.09MB
93. 21 - Dynamic Programming On Trees/002 Vertex Cover (greedy).mp439.26MB
94. 21 - Dynamic Programming On Trees/003 Definitions and Rules.mp490.93MB
95. 21 - Dynamic Programming On Trees/004 Vertex Cover DP.mp4106.61MB
96. 21 - Dynamic Programming On Trees/005 DP code (Recursion + Memoisation).mp484.02MB
97. 21 - Dynamic Programming On Trees/006 DP on trees using DFS.mp422.04MB
98. 21 - Dynamic Programming On Trees/007 DP on trees using bfs.mp480.35MB
99. 21 - Dynamic Programming On Trees/008 Tree Diameter CSES.mp4135.32MB
100. 21 - Dynamic Programming On Trees/009 Tree Diameter (code).mp456.76MB
101. 21 - Dynamic Programming On Trees/010 Nitpick.mp44.81MB
102. 21 - Dynamic Programming On Trees/011 Distance Tree 1.mp4203.35MB
103. 21 - Dynamic Programming On Trees/012 Distance Tree (code).mp4164.23MB
104. 22 - Network Flow/001 Introduction to Network.mp412.83MB
105. 22 - Network Flow/002 Introduction to Maximum Flow in a Network.mp462.47MB
106. 22 - Network Flow/003 Residual Networks and Augmenting Paths.mp4247.64MB
107. 22 - Network Flow/004 Ford-Fulkerson and Edmond-Karp Algorithm.mp4264.2MB
108. 22 - Network Flow/005 Dinic's Algorithm.mp4250.26MB
109. 22 - Network Flow/006 Dinic's Algorithm Code.mp4339.83MB
110. 22 - Network Flow/007 Applications of Max Flow as Maximum Bipartite Matching.mp4302.03MB
111. 23 - Bonus Graph + Data Structures/001 Board Game.mp429.73MB
112. 23 - Bonus Graph + Data Structures/002 Board Game Code.mp460.44MB