GetFreeCourses Co Udemy Graph Theory Algorithms for Competitive Programming 2022

GetFreeCourses Co Udemy Graph Theory Algorithms for Competitive Programming 2022

Name	GetFreeCourses.Co-Udemy-Graph Theory Algorithms for Competitive Programming (2022)	DOWNLOAD Copy Link
Total Size	9.4 GB
Total Files	262
Last Seen	2024-10-07 00:32
Hash	6B39503772F865A1D78E8044259D2C58C9A466B8

/01 - Introduction/
001 Course Orientation!.mp4	103.0 MB
001 Course Orientation!_en.srt	10.1 KB
002 QA Section & Discord Community.html	2.4 KB
003 Graphs Code Repository C++ and Java!.html	0.4 KB
004 Exercise Solutions - Code Repository!.html	0.7 KB
005 Sharing Feedback.html	0.2 KB
/02 - Setting Up Sublime [optional]/
001 Sublime Setup.mp4	34.5 MB
001 Sublime Setup_en.srt	14.0 KB
002 Adding Master Header File.mp4	33.6 MB
002 Adding Master Header File_en.srt	4.6 KB
003 Escaping Online Judges.mp4	19.2 MB
003 Escaping Online Judges_en.srt	9.5 KB
004 Common Code Snippets.mp4	13.9 MB
004 Common Code Snippets_en.srt	7.2 KB
005 Using Macros.mp4	28.1 MB
005 Using Macros_en.srt	13.8 KB
006 Example Code Explained.mp4	157.1 MB
006 Example Code Explained_en.srt	28.7 KB
/03 - Graph Representation/
001 Graphs Introduction.mp4	147.5 MB
001 Graphs Introduction_en.srt	17.3 KB
002 Graph Applications.mp4	18.8 MB
002 Graph Applications_en.srt	8.2 KB
003 Graph Key Terms.mp4	21.0 MB
003 Graph Key Terms_en.srt	12.7 KB
004 Adjacency List Representation.mp4	17.4 MB
004 Adjacency List Representation_en.srt	10.4 KB
005 Adjacency List Representation with Node Class.mp4	28.2 MB
005 Adjacency List Representation with Node Class_en.srt	10.8 KB
006 Some Helpful Webinars [Optional].html	0.4 KB
GetFreeCourses.Co.url	0.1 KB
/04 - Breath First Search/
001 Breadth First Search.mp4	16.1 MB
001 Breadth First Search_en.srt	9.1 KB
002 BFS Code.mp4	69.4 MB
002 BFS Code_en.srt	8.7 KB
003 BFS Shortest Path.mp4	10.2 MB
003 BFS Shortest Path_en.srt	5.9 KB
004 BFS Shortest Path Code.mp4	19.3 MB
004 BFS Shortest Path Code_en.srt	6.8 KB
005 Snakes and Ladder Solution.mp4	106.0 MB
005 Snakes and Ladder Solution_en.srt	11.7 KB
/05 - Depth First Search/
001 DFS Concept.mp4	10.0 MB
001 DFS Concept_en.srt	5.7 KB
002 DFS Code.mp4	17.7 MB
002 DFS Code_en.srt	6.9 KB
003 Largest Island Solution.mp4	49.4 MB
003 Largest Island Solution_en.srt	16.5 KB
/06 - Cycle Detection/
001 Cycle Detection in Undirected Graph.mp4	9.5 MB
001 Cycle Detection in Undirected Graph_en.srt	5.1 KB
002 Cycle Detection in Undirected Graph Code.mp4	28.0 MB
002 Cycle Detection in Undirected Graph Code_en.srt	10.5 KB
003 Directed Graph - Cycle Detection.mp4	23.2 MB
003 Directed Graph - Cycle Detection_en.srt	12.6 KB
004 Directed Graph - Cycle Detection Code.mp4	34.5 MB
004 Directed Graph - Cycle Detection Code_en.srt	15.6 KB
005 Bipartite Graph.mp4	14.5 MB
005 Bipartite Graph_en.srt	10.0 KB
006 Bipartite Graph Code.mp4	34.7 MB
006 Bipartite Graph Code_en.srt	16.3 KB
/07 - Directed Acyclic Graph/
001 Directed Acyclic Graph & Topological Ordering.mp4	18.9 MB
001 Directed Acyclic Graph & Topological Ordering_en.srt	5.9 KB
002 Topological Sort Algorithm.mp4	11.6 MB
002 Topological Sort Algorithm_en.srt	6.8 KB
003 Topological Ordering BFS Code.mp4	13.5 MB
003 Topological Ordering BFS Code_en.srt	6.9 KB
004 Toplogical Order using DFS.mp4	56.1 MB
004 Toplogical Order using DFS_en.srt	6.7 KB
005 Topological Ordering using DFS Code.mp4	14.6 MB
005 Topological Ordering using DFS Code_en.srt	5.5 KB
/08 - Disjoint Set Union/
001 Disjoint Set Union Introduction.mp4	10.7 MB
001 Disjoint Set Union Introduction_en.srt	5.5 KB
002 DSU Data Structure - Union & Find Ops.mp4	19.9 MB
002 DSU Data Structure - Union & Find Ops_en.srt	11.3 KB
003 DSU Data Structure.mp4	15.8 MB
003 DSU Data Structure_en.srt	8.5 KB
004 DSU Implementation.mp4	33.6 MB
004 DSU Implementation_en.srt	14.6 KB
005 Union by Rank.mp4	32.2 MB
005 Union by Rank_en.srt	11.1 KB
006 Path Compression Optimisation.mp4	23.6 MB
006 Path Compression Optimisation_en.srt	10.5 KB
007 DSU Dry Run.mp4	42.5 MB
007 DSU Dry Run_en.srt	15.4 KB
GetFreeCourses.Co.url	0.1 KB
/09 - Minimum Spanning Trees/
001 Introduction to Minimum Spanning Trees!.mp4	33.0 MB
001 Introduction to Minimum Spanning Trees!_en.srt	4.9 KB
002 Prim's Algorithm.mp4	37.3 MB
002 Prim's Algorithm_en.srt	24.5 KB
003 Prim's Code.mp4	60.3 MB
003 Prim's Code_en.srt	21.3 KB
004 Kruskal's Algorithm.mp4	19.0 MB
004 Kruskal's Algorithm_en.srt	11.2 KB
005 Kruskal's Code.mp4	35.2 MB
005 Kruskal's Code_en.srt	15.0 KB
/10 - Shortest Path Algorithms/
001 Introduction to Shortest Path Algorithms.mp4	19.9 MB
001 Introduction to Shortest Path Algorithms_en.srt	11.4 KB
002 Dijkshtra's Algorithm.mp4	100.8 MB
002 Dijkshtra's Algorithm_en.srt	12.7 KB
003 Dijkshtra's Algorithm Code.mp4	48.8 MB
003 Dijkshtra's Algorithm Code_en.srt	18.9 KB
004 Bellman Ford Algorithm.mp4	65.5 MB
004 Bellman Ford Algorithm_en.srt	41.3 KB
005 Bellman Ford Code.mp4	16.9 MB
005 Bellman Ford Code_en.srt	9.9 KB
006 Floyd Warshall.mp4	232.7 MB
006 Floyd Warshall_en.srt	38.8 KB
007 Floyd Warshall Code.mp4	26.9 MB
007 Floyd Warshall Code_en.srt	9.4 KB
008 Solution - Shortest Path in Grid!.mp4	40.0 MB
008 Solution - Shortest Path in Grid!_en.srt	15.5 KB
/11 - Travelling Salesman Problem/
001 Travelling Salesman Problem.mp4	36.5 MB
001 Travelling Salesman Problem_en.srt	15.3 KB
002 Travelling Salesman Intution.mp4	11.6 MB
002 Travelling Salesman Intution_en.srt	5.0 KB
003 TSP Brute Force.mp4	41.9 MB
003 TSP Brute Force_en.srt	15.0 KB
004 TSP DP + Bitmasking.mp4	9.8 MB
004 TSP DP + Bitmasking_en.srt	3.6 KB
/12 - Flood Fill/
001 Flood Fill Introduction.mp4	42.5 MB
001 Flood Fill Introduction_en.srt	7.3 KB
002 Flood-Fill-Total-connected-Components.cpp	0.8 KB
002 Number of Islands.mp4	204.9 MB
002 Number of Islands_en.srt	23.9 KB
003 Coloring Islands.mp4	26.5 MB
003 Coloring Islands_en.srt	8.9 KB
003 Flood-fill-color-count.cpp	1.1 KB
004 Biggest Island.mp4	16.7 MB
004 Biggest Island_en.srt	4.6 KB
004 flood-fill-largest-island.cpp	1.4 KB
005 Flood-Fill-make-largest-island.cpp	1.4 KB
005 Make Largest island.mp4	183.3 MB
005 Make Largest island_en.srt	24.7 KB
GetFreeCourses.Co.url	0.1 KB
/13 - Multi - Source BFS/
001 Introduction to Multi Source BFS.mp4	83.1 MB
001 Introduction to Multi Source BFS_en.srt	15.2 KB
002 Multi-source-BFS-minimum-operations.cpp	1.1 KB
002 Problem on Multi Source BFS.mp4	199.8 MB
002 Problem on Multi Source BFS_en.srt	26.6 KB
002 multisurce-BFS-minimum-distance.cpp	1.1 KB
003 Bonus Problem on Multi Source BFS.mp4	110.3 MB
003 Bonus Problem on Multi Source BFS_en.srt	22.4 KB
003 shortest-path-from-first-row-to-last-row.cpp	1.3 KB
004 01 BFS.mp4	50.9 MB
004 01 BFS_en.srt	10.2 KB
/14 - DFS-Tree and Backedges/
001 Introduction to DFS tree and Backedges.mp4	32.2 MB
001 Introduction to DFS tree and Backedges_en.srt	12.9 KB
002 DFS Tree and backedges in Undirected graph.mp4	108.5 MB
002 DFS Tree and backedges in Undirected graph_en.srt	23.9 KB
002 DFS-tree-and-backedge-code.cpp	0.7 KB
003 DFS Tree and Backedges in Directed and Undirectde graphs.mp4	224.0 MB
003 DFS Tree and Backedges in Directed and Undirectde graphs_en.srt	31.4 KB
003 DFS-tree-and-backedges-in-Directed-Graphs.cpp	0.8 KB
004 Print cycle in a graph.mp4	75.8 MB
004 Print cycle in a graph_en.srt	14.0 KB
004 print-cycle-in-a-graph.cpp	0.9 KB
/15 - Articulation Points & Bridges/
001 Introduction and definitions.mp4	54.8 MB
001 Introduction and definitions_en.srt	18.0 KB
002 Discovered Time.mp4	73.7 MB
002 Discovered Time_en.srt	16.5 KB
003 Lowest Time or Low Link.mp4	215.1 MB
003 Lowest Time or Low Link_en.srt	33.9 KB
004 Algorithm.mp4	110.6 MB
004 Algorithm_en.srt	25.4 KB
005 Coding the Algorithm.mp4	154.2 MB
005 Coding the Algorithm_en.srt	23.1 KB
005 articulation-point-and-bridges.cpp	1.2 KB
/16 - Strongly Connected Components/
001 Introduction to Topological Order and Strongly Connected Components.mp4	116.0 MB
001 Introduction to Topological Order and Strongly Connected Components_en.srt	25.3 KB
002 Algorithm and Code to find Topological Ordering.mp4	124.6 MB
002 Algorithm and Code to find Topological Ordering_en.srt	27.4 KB
002 topological-Order.cpp	0.7 KB
003 Introduction to Strongly Connected Component.mp4	62.0 MB
003 Introduction to Strongly Connected Component_en.srt	14.0 KB
004 Condensed Component Graph.mp4	38.6 MB
004 Condensed Component Graph_en.srt	17.1 KB
005 Kosaraju Algorithm for Strongly Connected Component.mp4	212.5 MB
005 Kosaraju Algorithm for Strongly Connected Component_en.srt	40.9 KB
006 Kosaraju Algorithm for Strongly Connected Component Code.mp4	95.6 MB
006 Kosaraju Algorithm for Strongly Connected Component Code_en.srt	13.6 KB
006 kosaraju-algorithm-for-SCC.cpp	1.1 KB
/17 - Trees/
001 Introduction and properties of trees.mp4	249.2 MB
001 Introduction and properties of trees_en.srt	31.7 KB
002 DFS on trees.mp4	31.9 MB
002 DFS on trees_en.srt	10.5 KB
003 Print all ancestors in a tree.mp4	108.4 MB
003 Print all ancestors in a tree_en.srt	10.7 KB
003 ancestor-printing.cpp	0.6 KB
GetFreeCourses.Co.url	0.1 KB
/18 - Euler Tour/
001 Introduction.mp4	93.6 MB
001 Introduction_en.srt	14.3 KB
002 Applications.mp4	304.6 MB
002 Applications_en.srt	28.6 KB
002 euler-tours.cpp	0.7 KB
003 Code.mp4	39.6 MB
003 Code_en.srt	16.1 KB
003 best-euler-tour	1.1 KB
/19 - LCA/
001 Introduction.mp4	104.5 MB
001 Introduction_en.srt	17.5 KB
002 LCA (Brute Force).mp4	80.8 MB
002 LCA (Brute Force)_en.srt	20.2 KB
002 LCA-using-2-pointers.cpp	1.0 KB
003 LCA using Binary Lifting.mp4	415.8 MB
003 LCA using Binary Lifting_en.srt	51.4 KB
003 LCA-using-sparse-table.cpp	1.5 KB
/20 - Re-rooting of trees/
001 Introduction and brute force.mp4	126.8 MB
001 Introduction and brute force_en.srt	22.4 KB
001 Re-rooting-brrute-force.cpp	0.7 KB
002 Approach to re root the tree.mp4	245.3 MB
002 Approach to re root the tree_en.srt	26.8 KB
003 Code for re rooting of the tree.mp4	92.7 MB
003 Code for re rooting of the tree_en.srt	14.1 KB
003 re-rooting.cpp	1.4 KB
/21 - Dynamic Programming On Trees/
001 DP introduction.mp4	26.3 MB
001 DP introduction_en.srt	8.4 KB
002 Vertex Cover (greedy).mp4	41.2 MB
002 Vertex Cover (greedy)_en.srt	13.8 KB
003 Definitions and Rules.mp4	95.3 MB
003 Definitions and Rules_en.srt	11.9 KB
004 Vertex Cover DP.mp4	111.8 MB
004 Vertex Cover DP_en.srt	22.7 KB
005 DP code (Recursion + Memoisation).mp4	88.1 MB
005 DP code (Recursion + Memoisation)_en.srt	14.6 KB
005 vertex-cover-spoj-dp.cpp	0.8 KB
006 DP on trees using DFS.mp4	23.1 MB
006 DP on trees using DFS_en.srt	8.1 KB
006 vertex-cover-dfs.cpp	0.7 KB
007 DP on trees using bfs.mp4	84.3 MB
007 DP on trees using bfs_en.srt	11.5 KB
007 vertex-cover-spoj-bfs.cpp	0.9 KB
008 Tree Diameter CSES.mp4	141.9 MB
008 Tree Diameter CSES_en.srt	21.5 KB
009 Tree Diameter (code).mp4	59.5 MB
009 Tree Diameter (code)_en.srt	13.9 KB
009 diameter-code.cpp	0.8 KB
010 Nitpick.mp4	5.0 MB
010 Nitpick_en.srt	2.2 KB
010 diameter-code.cpp	0.8 KB
011 Distance Tree 1.mp4	213.2 MB
011 Distance Tree 1_en.srt	31.5 KB
012 Distance Tree (code).mp4	172.2 MB
012 Distance Tree (code)_en.srt	23.8 KB
013 Try These.html	0.1 KB
/22 - Network Flow/
001 Introduction to Network.mp4	13.5 MB
001 Introduction to Network_en.srt	5.7 KB
002 Introduction to Maximum Flow in a Network.mp4	65.5 MB
002 Introduction to Maximum Flow in a Network_en.srt	12.1 KB
003 Residual Networks and Augmenting Paths.mp4	259.7 MB
003 Residual Networks and Augmenting Paths_en.srt	34.0 KB
004 Ford-Fulkerson and Edmond-Karp Algorithm.mp4	277.0 MB
004 Ford-Fulkerson and Edmond-Karp Algorithm_en.srt	33.5 KB
005 Dinic's Algorithm.mp4	262.4 MB
005 Dinic's Algorithm_en.srt	34.0 KB
006 Dinic's Algorithm Code.mp4	356.3 MB
006 Dinic's Algorithm Code_en.srt	41.7 KB
006 dinics-algprithm.cpp	2.0 KB
007 Applications of Max Flow as Maximum Bipartite Matching.mp4	316.7 MB
007 Applications of Max Flow as Maximum Bipartite Matching_en.srt	30.7 KB
/23 - Bonus Graph + Data Structures/
001 Board Game.mp4	31.2 MB
001 Board Game_en.srt	16.2 KB
002 Board Game Code.mp4	63.4 MB
002 Board Game Code_en.srt	22.7 KB
/
Download Paid Udemy Courses For Free.url	0.1 KB
GetFreeCourses.Co.url	0.1 KB
Total files 262