GetFreeCourses.Co-Udemy-Competitive Programming Essentials, Master Algorithms 2022

Creation Time	July 12, 2024, 10:22 p.m.
Last Access Time	Oct. 26, 2025, 2:09 p.m.
File Size	19.0 GB
Keywords	Essentials Programming Co-Udemy-Competitive GetFreeCourses Algorithms 2022 Master
Total Requests	165
Total Files	791
Magnet Link	Please wait ...
	Download (Magnet Link) Play (Watch Online)

36 - Advance Dynamic Programming Problems/007 Knapsack 2.mp4 456.9 MB
30 - Lowest Common Ancestors/003 LCA using Binary Lifting.mp4 397.1 MB
36 - Advance Dynamic Programming Problems/021 Candies.mp4 274.9 MB
38 - Geometric Algorithms - Convex Hull/004 Graham's Scan Algorithm Code.mp4 255.5 MB
36 - Advance Dynamic Programming Problems/004 Frogs - 2.mp4 252.1 MB
09 - Pigeonhole Principle/005 Holiday.mp4 241.1 MB
29 - Graphs as Trees/001 Trees.mp4 237.8 MB
22 - Segment Trees/007 Code.mp4 236.5 MB
36 - Advance Dynamic Programming Problems/019 Deque (first solution).mp4 230.9 MB
36 - Advance Dynamic Programming Problems/032 Flowers (code).mp4 230.8 MB
25 - Sqrt Decomposition/006 Code and Complexity of MO's Algorithm.mp4 230.3 MB
37 - Pattern String Matching/003 Trie.mp4 228.5 MB
27 - The Game Of NIM/003 Applications of Nim Sum.mp4 208.6 MB
31 - Directed Graphs & SCC's/006 Kosaraju Algorithm for Strongly Connected Component.mp4 202.6 MB
36 - Advance Dynamic Programming Problems/033 Walk.mp4 201.8 MB
36 - Advance Dynamic Programming Problems/030 Flowers.mp4 201.1 MB
36 - Advance Dynamic Programming Problems/009 LCS (code).mp4 200.0 MB
36 - Advance Dynamic Programming Problems/037 Permutation.mp4 196.2 MB
21 - Meet In The Middle/001 Introduction.mp4 194.0 MB
27 - The Game Of NIM/004 Examples of Nim Games.mp4 192.7 MB
36 - Advance Dynamic Programming Problems/006 Knapsack 1.mp4 178.7 MB
36 - Advance Dynamic Programming Problems/003 Frogs - 1.mp4 174.3 MB
08 - Linear Recurrences & Matrix Exponentiation/005 Matrix Exponentiation Code.mp4 173.5 MB
36 - Advance Dynamic Programming Problems/036 Digit Sum (code).mp4 173.1 MB
08 - Linear Recurrences & Matrix Exponentiation/004 Matrix Exponentiation Introduction.mp4 172.2 MB
23 - Lazy Propagation/003 Code.mp4 166.6 MB
20 - Greedy Algorithms/006 Kingdom Defense.mp4 162.7 MB
37 - Pattern String Matching/008 Rabin Karp algorithm Code.mp4 161.2 MB
42 - CP Guidance/001 Getting started with Codeforces Spoj.mp4 160.3 MB
23 - Lazy Propagation/002 Algorithm.mp4 157.3 MB
38 - Geometric Algorithms - Convex Hull/003 Graham's Scan algorithm.mp4 155.3 MB
19 - Divide & Conquer/009 Ternary Search.mp4 150.5 MB
02 - Setting Up Sublime [Optional]/006 Example Code Explained.mp4 149.8 MB
37 - Pattern String Matching/005 String Hashing - Polynomial Hash Function.mp4 147.4 MB
36 - Advance Dynamic Programming Problems/005 Vacation.mp4 145.1 MB
36 - Advance Dynamic Programming Problems/027 Matching (code).mp4 142.5 MB
39 - Interactive Problems/002 Codeforces - Guess the Number.mp4 137.2 MB
36 - Advance Dynamic Programming Problems/035 Digit Sum.mp4 134.2 MB
36 - Advance Dynamic Programming Problems/039 Permutation (code).mp4 133.0 MB
39 - Interactive Problems/004 Lost Numbers.mp4 132.5 MB
24 - Fenwick Trees/004 Code.mp4 132.4 MB
36 - Advance Dynamic Programming Problems/024 Slimes (code).mp4 131.7 MB
36 - Advance Dynamic Programming Problems/018 Stones.mp4 130.9 MB
25 - Sqrt Decomposition/003 DQUERY SPOJ using Mo's Algorithm.mp4 130.7 MB
24 - Fenwick Trees/001 Structure.mp4 127.0 MB
36 - Advance Dynamic Programming Problems/017 Sushi (code).mp4 121.7 MB
24 - Fenwick Trees/003 Update.mp4 119.6 MB
26 - Combinatorial Games/004 N and P positions.mp4 119.3 MB
31 - Directed Graphs & SCC's/002 Topological Sort.mp4 118.9 MB
25 - Sqrt Decomposition/007 DQUERY using Fenwick Tree.mp4 117.4 MB
34 - Shortest Paths Algorithms/003 Dijkstra's Algorithm Code.mp4 117.1 MB
25 - Sqrt Decomposition/005 4 Pointers Technique.mp4 116.0 MB
12 - Prime Numbers & Factorisation/002 Prime Sieve.mp4 112.6 MB
31 - Directed Graphs & SCC's/001 Intro.mp4 110.9 MB
41 - Policy Based Data Structures/002 Structure and Working.mp4 109.1 MB
39 - Interactive Problems/001 Introduction.mp4 108.2 MB
11 - Inclusion Exclusion Principle/004 Total Number of Divisors Till N code.mp4 106.8 MB
36 - Advance Dynamic Programming Problems/020 Deque (second solution).mp4 105.7 MB
29 - Graphs as Trees/004 DFS Tree and Backedges Code.mp4 103.6 MB
08 - Linear Recurrences & Matrix Exponentiation/001 Binary Exponentiation.mp4 103.6 MB
36 - Advance Dynamic Programming Problems/016 Sushi.mp4 103.4 MB
39 - Interactive Problems/006 Xor Guessing.mp4 102.6 MB
30 - Lowest Common Ancestors/001 LCA introduction.mp4 99.6 MB
16 - Recursion/011 Tower Of Hanoi.mp4 99.0 MB
36 - Advance Dynamic Programming Problems/008 LCS.mp4 98.9 MB
03 - Time Space Complexity Analysis/001 Space Time Complexity Introduction.mp4 97.6 MB
11 - Inclusion Exclusion Principle/003 Problems.mp4 97.1 MB
34 - Shortest Paths Algorithms/002 Dijkstra's Algorithm.mp4 96.2 MB
31 - Directed Graphs & SCC's/005 Kosaraju Algorithm Code.mp4 91.2 MB
02 - Setting Up Sublime [Optional]/001 Sublime Setup.mp4 91.2 MB
36 - Advance Dynamic Programming Problems/028 Independent Set.mp4 90.3 MB
04 - Data Structures & STL Containers/001 Data Structures & STL Containers Revisited.mp4 89.5 MB
25 - Sqrt Decomposition/002 Range queries (Code).mp4 87.8 MB
25 - Sqrt Decomposition/001 Sqrt Decomposition Introduction.mp4 87.7 MB
14 - Theorems in Number Theory/001 Modulo Airthmetic.mp4 87.5 MB
36 - Advance Dynamic Programming Problems/010 Longest Path.mp4 87.2 MB
01 - Introduction/001 Introduction.mp4 86.7 MB
41 - Policy Based Data Structures/003 Using Coding Minutes IDE.mp4 85.5 MB
36 - Advance Dynamic Programming Problems/015 Coins (code).mp4 85.5 MB
39 - Interactive Problems/005 Lost Numbers (code).mp4 85.4 MB
38 - Geometric Algorithms - Convex Hull/005 Problem - Polygon (Codeforces).mp4 84.4 MB
36 - Advance Dynamic Programming Problems/012 Grid 1.mp4 83.7 MB
14 - Theorems in Number Theory/002 Modulo Arithmetic Code.mp4 81.6 MB
22 - Segment Trees/006 Facts and Properties.mp4 81.3 MB
14 - Theorems in Number Theory/005 nCr % P.mp4 79.5 MB
36 - Advance Dynamic Programming Problems/038 Permutation (Brute Force).mp4 78.0 MB
30 - Lowest Common Ancestors/002 LCA Brute Force.mp4 77.1 MB
36 - Advance Dynamic Programming Problems/022 Candies (code).mp4 77.0 MB
27 - The Game Of NIM/001 Game of Nim.mp4 76.5 MB
36 - Advance Dynamic Programming Problems/025 Matching.mp4 75.7 MB
08 - Linear Recurrences & Matrix Exponentiation/007 Fibosum(second approach).mp4 75.4 MB
09 - Pigeonhole Principle/006 Holiday Code.mp4 75.3 MB
34 - Shortest Paths Algorithms/006 Floyd Warshall Algorithm.mp4 75.0 MB
07 - Big Integers/007 Java Big Integer Class.mp4 74.6 MB
22 - Segment Trees/005 Update.mp4 70.9 MB
20 - Greedy Algorithms/004 Activity Selection Busyman.mp4 70.5 MB
36 - Advance Dynamic Programming Problems/034 Walk (code).mp4 69.3 MB
14 - Theorems in Number Theory/003 Fermat's Theorem.mp4 66.3 MB
41 - Policy Based Data Structures/001 Introduction & Applications.mp4 66.2 MB
28 - Graph Traversals/007 BFS.mp4 66.0 MB
24 - Fenwick Trees/002 Query.mp4 64.8 MB
42 - CP Guidance/002 Where to practice.mp4 63.8 MB
16 - Recursion/012 Tower Of Hanoi (code).mp4 63.0 MB
37 - Pattern String Matching/004 Pattern Matching using Trie.mp4 62.7 MB
34 - Shortest Paths Algorithms/004 Bellman Ford Algorithm.mp4 62.4 MB
39 - Interactive Problems/003 Guess the Number - code.mp4 62.3 MB
26 - Combinatorial Games/002 Combinatorial Games.mp4 61.4 MB
28 - Graph Traversals/013 Board Game Code.mp4 60.4 MB
06 - Bitmanipulation Problems/005 Unique Number - III.mp4 60.2 MB
22 - Segment Trees/004 Query.mp4 60.1 MB
24 - Fenwick Trees/007 Inversion Count Using Fenwick Tree Code.mp4 59.9 MB
26 - Combinatorial Games/003 Take Away Games.mp4 59.8 MB
31 - Directed Graphs & SCC's/003 SCC Theory.mp4 59.1 MB
36 - Advance Dynamic Programming Problems/001 Terms and Definitions.mp4 58.7 MB
33 - Spanning Trees/003 Prim's Code.mp4 57.5 MB
41 - Policy Based Data Structures/004 Inversion Count using PBDS.mp4 57.1 MB
07 - Big Integers/011 Big Integer Challenge - Julka.mp4 54.6 MB
39 - Interactive Problems/007 Xor Guessing (code).mp4 54.6 MB
17 - Backtracking/011 Sudoku Solver Code.mp4 52.9 MB
04 - Data Structures & STL Containers/003 Array STL.mp4 51.7 MB
37 - Pattern String Matching/002 Brute Force Pattern Matching using STL.mp4 51.7 MB
36 - Advance Dynamic Programming Problems/023 Slimes.mp4 51.6 MB
10 - Mathematical Expectation/001 Expectation.mp4 51.5 MB
20 - Greedy Algorithms/002 Indian Coin Change.mp4 50.7 MB
04 - Data Structures & STL Containers/005 Deque STL.mp4 50.3 MB
36 - Advance Dynamic Programming Problems/002 Tabulation vs Memoisation.mp4 48.0 MB
35 - Classical Dynamic Programming/003 N-K Ladders.mp4 48.0 MB
08 - Linear Recurrences & Matrix Exponentiation/006 Fibosum (spoj).mp4 47.9 MB
20 - Greedy Algorithms/005 Baised Standings.mp4 47.4 MB
12 - Prime Numbers & Factorisation/003 Sieve of Eratosthenes Code.mp4 47.2 MB
19 - Divide & Conquer/010 Ternary Search - Finding maximaminima of a parabola (Code).mp4 46.5 MB
02 - Setting Up Sublime [Optional]/004 Common Code Snippets.mp4 46.1 MB
21 - Meet In The Middle/002 Subsums Code.mp4 45.3 MB
37 - Pattern String Matching/006 Polynomial Hash Code.mp4 45.0 MB
23 - Lazy Propagation/001 Introduction.mp4 43.9 MB
04 - Data Structures & STL Containers/004 Vector STL.mp4 43.9 MB
09 - Pigeonhole Principle/004 Gray Similar Code.mp4 43.6 MB
04 - Data Structures & STL Containers/002 Arrays in C++.mp4 43.2 MB
35 - Classical Dynamic Programming/001 Introduction to Dynamic Programming.mp4 43.0 MB
03 - Time Space Complexity Analysis/002 Experimental Analysis.mp4 42.0 MB
22 - Segment Trees/003 Building.mp4 41.7 MB
36 - Advance Dynamic Programming Problems/029 Independent Set (code).mp4 40.9 MB
40 - Random Randomisation/001 Randomised Random Function.mp4 40.3 MB
19 - Divide & Conquer/002 Merge Sort Code.mp4 40.0 MB
06 - Bitmanipulation Problems/011 Travelling Salesman Code.mp4 39.9 MB
40 - Random Randomisation/002 Run Code for a Particular Time.mp4 39.1 MB
17 - Backtracking/009 N-Queen Ways.mp4 38.7 MB
08 - Linear Recurrences & Matrix Exponentiation/003 Fast Mutiplication.mp4 38.3 MB
17 - Backtracking/008 N-Queen Code.mp4 37.7 MB
31 - Directed Graphs & SCC's/004 Condensed Component Graph.mp4 36.9 MB
09 - Pigeonhole Principle/002 Problem DIVSUB.mp4 36.5 MB
35 - Classical Dynamic Programming/005 N-K Ladders Bottom Up.mp4 36.3 MB
11 - Inclusion Exclusion Principle/001 Inclusion Exclusion.mp4 36.3 MB
36 - Advance Dynamic Programming Problems/026 Matching continued.mp4 36.2 MB
33 - Spanning Trees/002 Prim's Algorithm.mp4 35.5 MB
15 - Combinatorics/006 Birthday Paradox Code.mp4 35.3 MB
33 - Spanning Trees/001 Dry Run.mp4 35.2 MB
06 - Bitmanipulation Problems/009 Travelling Salesman Problem.mp4 34.8 MB
15 - Combinatorics/001 Combinatorics Introduction.mp4 34.7 MB
12 - Prime Numbers & Factorisation/011 Segmented Sieve Code.mp4 34.7 MB
35 - Classical Dynamic Programming/011 Box Stacking Code.mp4 34.5 MB
36 - Advance Dynamic Programming Problems/011 Longest Path (code).mp4 33.9 MB
36 - Advance Dynamic Programming Problems/014 Coins.mp4 33.6 MB
16 - Recursion/001 Recursion Basics.mp4 33.1 MB
11 - Inclusion Exclusion Principle/002 Generalised Function.mp4 33.0 MB
16 - Recursion/004 Sorted Array Check.mp4 32.5 MB
24 - Fenwick Trees/006 Inversion Count Using Fenwick Tree.mp4 32.3 MB
02 - Setting Up Sublime [Optional]/002 Adding Master Header File.mp4 32.1 MB
32 - Disjoint Set Union Data Structure/004 DSU Implementation.mp4 32.0 MB
22 - Segment Trees/002 Introduction and Structure.mp4 31.7 MB
17 - Backtracking/002 Finding Subsets.mp4 31.2 MB
28 - Graph Traversals/002 Introduction.mp4 30.7 MB
29 - Graphs as Trees/003 DFS Trees and Backedges.mp4 30.7 MB
32 - Disjoint Set Union Data Structure/005 Union By Rank.mp4 30.7 MB
29 - Graphs as Trees/002 DFS on Trees.mp4 30.4 MB
07 - Big Integers/012 Big Integer Challenge Solution.mp4 30.4 MB
16 - Recursion/003 Fibonacci Series.mp4 30.3 MB
18 - Binary Search/006 Angry Bird Code.mp4 29.8 MB
28 - Graph Traversals/012 Board Game.mp4 29.7 MB
33 - Spanning Trees/005 Kruskal's Code.mp4 29.7 MB
07 - Big Integers/004 Big Addition Code.mp4 29.6 MB
19 - Divide & Conquer/007 Inversion Count.mp4 28.9 MB
14 - Theorems in Number Theory/008 Totient Function code using Seive.mp4 28.5 MB
18 - Binary Search/005 Angry Birds.mp4 28.4 MB
09 - Pigeonhole Principle/003 Applying Pigeonhole Principle.mp4 28.4 MB
37 - Pattern String Matching/007 Rolling Hash Rabin Karp Algorithm.mp4 28.2 MB
12 - Prime Numbers & Factorisation/001 Introduction.mp4 28.0 MB
17 - Backtracking/010 Sudoku Solver.mp4 27.9 MB
15 - Combinatorics/005 Birthday Paradox.mp4 27.7 MB
28 - Graph Traversals/005 Adjacency List.mp4 27.0 MB
02 - Setting Up Sublime [Optional]/005 Using Macros.mp4 26.8 MB
17 - Backtracking/007 N-Queen.mp4 26.3 MB
25 - Sqrt Decomposition/004 Sorting the queries according to MO's comparator.mp4 26.2 MB
38 - Geometric Algorithms - Convex Hull/002 Orientation of Points.mp4 25.8 MB
34 - Shortest Paths Algorithms/007 Floyd Warshall Code.mp4 25.6 MB
19 - Divide & Conquer/003 Quick Sort.mp4 25.6 MB
19 - Divide & Conquer/004 Quick Sort Code.mp4 25.6 MB
08 - Linear Recurrences & Matrix Exponentiation/002 Modular Binary Exponentiation.mp4 25.1 MB
07 - Big Integers/006 Large Factorials.mp4 24.6 MB
36 - Advance Dynamic Programming Problems/031 Flowers using segment tree.mp4 24.4 MB
17 - Backtracking/006 Brackets Code.mp4 24.3 MB
24 - Fenwick Trees/005 Inversion Count (Multiple Ways of solving it).mp4 23.9 MB
17 - Backtracking/004 Permuations.mp4 23.6 MB
12 - Prime Numbers & Factorisation/008 Prime Factorisation using Sieve O(LogN).mp4 22.7 MB
32 - Disjoint Set Union Data Structure/006 Path Compression.mp4 22.5 MB
06 - Bitmanipulation Problems/003 Unique Number - II.mp4 22.4 MB
15 - Combinatorics/002 Binomial Coefficients.mp4 22.1 MB
05 - Bitmanipulation Basics/001 Bitwise Operators.mp4 21.9 MB
18 - Binary Search/001 Binary Search.mp4 21.8 MB
18 - Binary Search/008 Game of Greed Code.mp4 21.5 MB
06 - Bitmanipulation Problems/006 Unique Number - III Code.mp4 21.5 MB
16 - Recursion/002 Factorial.mp4 21.3 MB
38 - Geometric Algorithms - Convex Hull/001 Introduction.mp4 20.7 MB
18 - Binary Search/007 Game of Greed.mp4 20.4 MB
13 - Extended Euclidean's Algorithm & Applications/006 Extended Euclidean Code.mp4 20.2 MB
35 - Classical Dynamic Programming/010 Box Stacking Problem.mp4 20.2 MB
28 - Graph Traversals/003 Graph Key Concepts.mp4 20.1 MB
07 - Big Integers/003 Big Addition Concept.mp4 19.7 MB
17 - Backtracking/003 Finding Subsets Code.mp4 19.6 MB
15 - Combinatorics/004 Computing Binomial Coefficients.mp4 19.0 MB
32 - Disjoint Set Union Data Structure/002 DSU Data Structure.mp4 19.0 MB
34 - Shortest Paths Algorithms/001 Shortest Path Introduction.mp4 18.9 MB
16 - Recursion/005 Understanding Recursion DIrections.mp4 18.8 MB
06 - Bitmanipulation Problems/004 Unique Number - II Code.mp4 18.7 MB
13 - Extended Euclidean's Algorithm & Applications/005 Extended Euclidean Example.mp4 18.7 MB
35 - Classical Dynamic Programming/006 Minimum Jums.mp4 18.6 MB
14 - Theorems in Number Theory/006 Chinese Remainder Theorem.mp4 18.5 MB
28 - Graph Traversals/011 Shortest Path Code.mp4 18.5 MB
13 - Extended Euclidean's Algorithm & Applications/001 GCD.mp4 18.4 MB
14 - Theorems in Number Theory/007 Totient Function.mp4 18.3 MB
02 - Setting Up Sublime [Optional]/003 Escaping Online Judges.mp4 18.3 MB
05 - Bitmanipulation Basics/007 Update ith Bit.mp4 18.3 MB
33 - Spanning Trees/004 Kruskal's Algorithm.mp4 18.2 MB
03 - Time Space Complexity Analysis/007 Analayis of BInary Search.mp4 18.1 MB
13 - Extended Euclidean's Algorithm & Applications/011 Linear Diophantine Equations.mp4 17.5 MB
05 - Bitmanipulation Basics/009 Clear Range of Bits.mp4 17.4 MB
36 - Advance Dynamic Programming Problems/013 Grid 1 (code).mp4 17.2 MB
35 - Classical Dynamic Programming/007 Minimum Jumps Code.mp4 17.0 MB
06 - Bitmanipulation Problems/001 Unique Number - I.mp4 16.9 MB
16 - Recursion/009 Count Strings.mp4 16.6 MB
28 - Graph Traversals/004 Adjacency List.mp4 16.5 MB
18 - Binary Search/003 Lower Bound and Upper Bound.mp4 16.5 MB
15 - Combinatorics/007 Catalan Numbers.mp4 16.5 MB
27 - The Game Of NIM/002 Nim Sum.mp4 16.3 MB
34 - Shortest Paths Algorithms/005 Bellman Ford Code.mp4 16.1 MB
07 - Big Integers/005 Array & Integer Multiplication.mp4 15.8 MB
12 - Prime Numbers & Factorisation/004 Prime Queries.mp4 15.8 MB
17 - Backtracking/005 Brackets.mp4 15.6 MB
16 - Recursion/010 Friend's Pairing Problem.mp4 15.5 MB
28 - Graph Traversals/006 BFS Concept.mp4 15.4 MB
12 - Prime Numbers & Factorisation/007 Prime Factorisation Code O(Sqrt(N)).mp4 15.3 MB
16 - Recursion/008 Tiling Problem.mp4 15.3 MB
12 - Prime Numbers & Factorisation/010 Segmented Sieve Algorithm.mp4 15.1 MB
32 - Disjoint Set Union Data Structure/003 Union & Find Ops.mp4 15.0 MB
20 - Greedy Algorithms/001 Greedy Introduction.mp4 14.9 MB
05 - Bitmanipulation Basics/012 Count Bits.mp4 14.9 MB
03 - Time Space Complexity Analysis/008 Analysis of Merge Sort.mp4 14.5 MB
35 - Classical Dynamic Programming/002 A Note About DP.mp4 14.3 MB
05 - Bitmanipulation Basics/014 Make it Binary.mp4 14.3 MB
05 - Bitmanipulation Basics/010 Replace Bits.mp4 13.8 MB
06 - Bitmanipulation Problems/007 Finding Subsets.mp4 13.7 MB
04 - Data Structures & STL Containers/008 Priority Queue STL.mp4 13.7 MB
28 - Graph Traversals/009 DFS Code.mp4 13.7 MB
15 - Combinatorics/009 Catalan Numbers Code - Iterative DP.mp4 13.5 MB
23 - Lazy Propagation/004 Bug and Code Continued.mp4 13.5 MB
19 - Divide & Conquer/006 Quick Select Code.mp4 13.4 MB
20 - Greedy Algorithms/003 Greedy vs DP.mp4 13.2 MB
19 - Divide & Conquer/008 Inversion Count Code.mp4 13.2 MB
16 - Recursion/007 Fast Power.mp4 12.9 MB
16 - Recursion/006 Power Function.mp4 12.9 MB
06 - Bitmanipulation Problems/008 Finding Subsets Code.mp4 12.4 MB
07 - Big Integers/009 Big Integers in Python.mp4 12.0 MB
35 - Classical Dynamic Programming/008 Longest Increasing Subsequence.mp4 11.7 MB
14 - Theorems in Number Theory/004 Factorial % P.mp4 11.6 MB
05 - Bitmanipulation Basics/008 Clear Last i Bits.mp4 11.6 MB
13 - Extended Euclidean's Algorithm & Applications/007 GCD using Extended Euclidean Algorithm.mp4 11.6 MB
05 - Bitmanipulation Basics/013 Count Bits Hack.mp4 11.4 MB
13 - Extended Euclidean's Algorithm & Applications/004 Extended Euclideans.mp4 11.2 MB
06 - Bitmanipulation Problems/010 Travelling Salesman Intution.mp4 11.0 MB
05 - Bitmanipulation Basics/006 Set ith Bit.mp4 11.0 MB
03 - Time Space Complexity Analysis/003 Big O Notation.mp4 10.8 MB
10 - Mathematical Expectation/010 Coupon Collector.mp4 10.6 MB
07 - Big Integers/002 Introduction to Big Integers.mp4 10.3 MB
05 - Bitmanipulation Basics/004 Get ith Bit.mp4 10.2 MB
32 - Disjoint Set Union Data Structure/001 DSU Introduction.mp4 10.2 MB
19 - Divide & Conquer/005 Quick Select.mp4 10.2 MB
13 - Extended Euclidean's Algorithm & Applications/010 MMI Code.mp4 10.1 MB
13 - Extended Euclidean's Algorithm & Applications/008 Multiplicative Modulo Inverse.mp4 10.0 MB
10 - Mathematical Expectation/006 Expected Throws - N Consecutive Heads.mp4 10.0 MB
19 - Divide & Conquer/001 Merge Sort.mp4 9.9 MB
35 - Classical Dynamic Programming/004 N-K Ladders Top Down.mp4 9.9 MB
12 - Prime Numbers & Factorisation/009 Segmented Sieve.mp4 9.8 MB
17 - Backtracking/001 Backtracking Problems.mp4 9.7 MB
28 - Graph Traversals/010 Shortest Path.mp4 9.7 MB
28 - Graph Traversals/008 DFS.mp4 9.6 MB
06 - Bitmanipulation Problems/012 Travelling Salesman - DP Optimisation.mp4 9.3 MB
03 - Time Space Complexity Analysis/006 Analysis of Bubble Sort.mp4 9.3 MB
05 - Bitmanipulation Basics/002 Left Shift & Right Shift.mp4 9.2 MB
10 - Mathematical Expectation/004 Expected Throws - One Head.mp4 8.8 MB
10 - Mathematical Expectation/005 Expected Throws - Two Consecutive Heads.mp4 8.7 MB
13 - Extended Euclidean's Algorithm & Applications/009 Computing Multiplicative Modulo Inverse.mp4 8.6 MB
13 - Extended Euclidean's Algorithm & Applications/003 GCD Complexity.mp4 8.4 MB
15 - Combinatorics/008 Catalan Numbers Code - Recursive.mp4 8.4 MB
10 - Mathematical Expectation/007 Bernaulli's Trial.mp4 8.1 MB
05 - Bitmanipulation Basics/005 Clear ith Bit.mp4 8.0 MB
03 - Time Space Complexity Analysis/009 Avoiding TLE Errors.mp4 7.9 MB
05 - Bitmanipulation Basics/011 Two Power.mp4 7.8 MB
04 - Data Structures & STL Containers/006 Stack STL.mp4 7.8 MB
18 - Binary Search/004 Lower Bound Code.mp4 7.6 MB
03 - Time Space Complexity Analysis/010 Complexities for Worst Case AC.mp4 7.5 MB
07 - Big Integers/008 BigInteger Example.mp4 7.4 MB
05 - Bitmanipulation Basics/003 Odd Even.mp4 7.3 MB
12 - Prime Numbers & Factorisation/005 Prime Factorisation.mp4 7.2 MB
09 - Pigeonhole Principle/001 Pigeonhole Principle.mp4 7.1 MB
10 - Mathematical Expectation/002 Linearity of Expectation.mp4 6.9 MB
18 - Binary Search/002 Binary Search Code.mp4 6.7 MB
03 - Time Space Complexity Analysis/005 Nested Loops - II.mp4 6.6 MB
35 - Classical Dynamic Programming/009 Longest Increasing Subsequence Code.mp4 6.3 MB
13 - Extended Euclidean's Algorithm & Applications/002 Euclid's Algorithm Code.mp4 6.3 MB
03 - Time Space Complexity Analysis/004 Nested Loops.mp4 6.0 MB
12 - Prime Numbers & Factorisation/006 Prime Factorisation Code O(N).mp4 5.7 MB
10 - Mathematical Expectation/009 Bernoulli's Trial.mp4 4.9 MB
04 - Data Structures & STL Containers/007 Queue STL.mp4 4.6 MB
13 - Extended Euclidean's Algorithm & Applications/012 Linear Diophantine Equation - Family of Solutions.mp4 4.3 MB
10 - Mathematical Expectation/003 Problem - Linearity of Expectation.mp4 4.1 MB
06 - Bitmanipulation Problems/002 Unique Number - I Code.mp4 3.3 MB
10 - Mathematical Expectation/008 Choose Number.mp4 2.4 MB
39 - Interactive Problems/003 guess-the-number 58.9 KB
36 - Advance Dynamic Programming Problems/007 Knapsack 2_en.vtt 44.9 KB
30 - Lowest Common Ancestors/003 LCA using Binary Lifting_en.vtt 44.8 KB
31 - Directed Graphs & SCC's/006 Kosaraju Algorithm for Strongly Connected Component_en.vtt 35.6 KB
34 - Shortest Paths Algorithms/004 Bellman Ford Algorithm_en.vtt 35.3 KB
36 - Advance Dynamic Programming Problems/019 Deque (first solution)_en.vtt 35.2 KB
37 - Pattern String Matching/003 Trie_en.vtt 35.0 KB
34 - Shortest Paths Algorithms/006 Floyd Warshall Algorithm_en.vtt 33.5 KB
36 - Advance Dynamic Programming Problems/037 Permutation_en.vtt 32.8 KB
36 - Advance Dynamic Programming Problems/021 Candies_en.vtt 32.3 KB
22 - Segment Trees/007 Code_en.vtt 31.0 KB
36 - Advance Dynamic Programming Problems/008 LCS_en.vtt 30.1 KB
36 - Advance Dynamic Programming Problems/004 Frogs - 2_en.vtt 29.1 KB
36 - Advance Dynamic Programming Problems/006 Knapsack 1_en.vtt 28.7 KB
36 - Advance Dynamic Programming Problems/003 Frogs - 1_en.vtt 28.3 KB
27 - The Game Of NIM/003 Applications of Nim Sum_en.vtt 27.9 KB
36 - Advance Dynamic Programming Problems/028 Independent Set_en.vtt 27.4 KB
29 - Graphs as Trees/001 Trees_en.vtt 27.2 KB
09 - Pigeonhole Principle/005 Holiday_en.vtt 26.6 KB
38 - Geometric Algorithms - Convex Hull/004 Graham's Scan Algorithm Code_en.vtt 26.4 KB
16 - Recursion/011 Tower Of Hanoi_en.vtt 26.2 KB
38 - Geometric Algorithms - Convex Hull/003 Graham's Scan algorithm_en.vtt 26.0 KB
21 - Meet In The Middle/001 Introduction_en.vtt 25.6 KB
36 - Advance Dynamic Programming Problems/009 LCS (code)_en.vtt 24.3 KB
02 - Setting Up Sublime [Optional]/006 Example Code Explained_en.vtt 23.7 KB
36 - Advance Dynamic Programming Problems/005 Vacation_en.vtt 23.6 KB
25 - Sqrt Decomposition/006 Code and Complexity of MO's Algorithm_en.vtt 23.5 KB
39 - Interactive Problems/001 Introduction_en.vtt 23.5 KB
31 - Directed Graphs & SCC's/002 Topological Sort_en.vtt 23.3 KB
36 - Advance Dynamic Programming Problems/032 Flowers (code)_en.vtt 23.1 KB
36 - Advance Dynamic Programming Problems/027 Matching (code)_en.vtt 22.7 KB
22 - Segment Trees/004 Query_en.vtt 22.3 KB
31 - Directed Graphs & SCC's/001 Intro_en.vtt 22.2 KB
36 - Advance Dynamic Programming Problems/030 Flowers_en.vtt 22.1 KB
04 - Data Structures & STL Containers/004 Vector STL_en.vtt 21.7 KB
25 - Sqrt Decomposition/007 DQUERY using Fenwick Tree_en.vtt 21.7 KB
36 - Advance Dynamic Programming Problems/039 Permutation (code)_en.vtt 21.6 KB
36 - Advance Dynamic Programming Problems/038 Permutation (Brute Force)_en.vtt 21.2 KB
36 - Advance Dynamic Programming Problems/036 Digit Sum (code)_en.vtt 20.9 KB
36 - Advance Dynamic Programming Problems/035 Digit Sum_en.vtt 20.9 KB
33 - Spanning Trees/002 Prim's Algorithm_en.vtt 20.9 KB
29 - Graphs as Trees/004 DFS Tree and Backedges Code_en.vtt 20.4 KB
25 - Sqrt Decomposition/005 4 Pointers Technique_en.vtt 19.7 KB
28 - Graph Traversals/013 Board Game Code_en.vtt 19.5 KB
26 - Combinatorial Games/003 Take Away Games_en.vtt 19.3 KB
35 - Classical Dynamic Programming/001 Introduction to Dynamic Programming_en.vtt 19.3 KB
17 - Backtracking/011 Sudoku Solver Code_en.vtt 19.1 KB
36 - Advance Dynamic Programming Problems/033 Walk_en.vtt 19.0 KB
36 - Advance Dynamic Programming Problems/024 Slimes (code)_en.vtt 19.0 KB
33 - Spanning Trees/003 Prim's Code_en.vtt 18.7 KB
27 - The Game Of NIM/004 Examples of Nim Games_en.vtt 18.6 KB
23 - Lazy Propagation/002 Algorithm_en.vtt 18.5 KB
36 - Advance Dynamic Programming Problems/001 Terms and Definitions_en.vtt 18.5 KB
19 - Divide & Conquer/009 Ternary Search_en.vtt 18.2 KB
17 - Backtracking/009 N-Queen Ways_en.vtt 18.2 KB
08 - Linear Recurrences & Matrix Exponentiation/001 Binary Exponentiation_en.vtt 18.0 KB
09 - Pigeonhole Principle/006 Holiday Code_en.vtt 17.9 KB
30 - Lowest Common Ancestors/002 LCA Brute Force_en.vtt 17.6 KB
08 - Linear Recurrences & Matrix Exponentiation/004 Matrix Exponentiation Introduction_en.vtt 17.6 KB
42 - CP Guidance/001 Getting started with Codeforces Spoj_en.vtt 17.5 KB
17 - Backtracking/008 N-Queen Code_en.vtt 17.4 KB
04 - Data Structures & STL Containers/003 Array STL_en.vtt 17.1 KB
11 - Inclusion Exclusion Principle/003 Problems_en.vtt 17.1 KB
04 - Data Structures & STL Containers/001 Data Structures & STL Containers Revisited_en.vtt 16.7 KB
19 - Divide & Conquer/007 Inversion Count_en.vtt 16.5 KB
36 - Advance Dynamic Programming Problems/016 Sushi_en.vtt 16.4 KB
37 - Pattern String Matching/005 String Hashing - Polynomial Hash Function_en.vtt 16.3 KB
41 - Policy Based Data Structures/004 Inversion Count using PBDS_en.vtt 16.3 KB
08 - Linear Recurrences & Matrix Exponentiation/005 Matrix Exponentiation Code_en.vtt 16.3 KB
39 - Interactive Problems/002 Codeforces - Guess the Number_en.vtt 16.2 KB
07 - Big Integers/007 Java Big Integer Class_en.vtt 16.0 KB
24 - Fenwick Trees/002 Query_en.vtt 16.0 KB
34 - Shortest Paths Algorithms/003 Dijkstra's Algorithm Code_en.vtt 16.0 KB
12 - Prime Numbers & Factorisation/011 Segmented Sieve Code_en.vtt 15.9 KB
17 - Backtracking/002 Finding Subsets_en.vtt 15.7 KB
36 - Advance Dynamic Programming Problems/023 Slimes_en.vtt 15.5 KB
20 - Greedy Algorithms/006 Kingdom Defense_en.vtt 15.2 KB
41 - Policy Based Data Structures/002 Structure and Working_en.vtt 15.2 KB
31 - Directed Graphs & SCC's/004 Condensed Component Graph_en.vtt 15.1 KB
30 - Lowest Common Ancestors/001 LCA introduction_en.vtt 15.1 KB
23 - Lazy Propagation/003 Code_en.vtt 15.1 KB
36 - Advance Dynamic Programming Problems/018 Stones_en.vtt 14.9 KB
07 - Big Integers/004 Big Addition Code_en.vtt 14.9 KB
15 - Combinatorics/001 Combinatorics Introduction_en.vtt 14.9 KB
28 - Graph Traversals/002 Introduction_en.vtt 14.8 KB
14 - Theorems in Number Theory/001 Modulo Airthmetic_en.vtt 14.8 KB
04 - Data Structures & STL Containers/002 Arrays in C++_en.vtt 14.6 KB
17 - Backtracking/007 N-Queen_en.vtt 14.6 KB
37 - Pattern String Matching/004 Pattern Matching using Trie_en.vtt 14.4 KB
25 - Sqrt Decomposition/001 Sqrt Decomposition Introduction_en.vtt 14.4 KB
06 - Bitmanipulation Problems/009 Travelling Salesman Problem_en.vtt 14.2 KB
28 - Graph Traversals/012 Board Game_en.vtt 14.1 KB
06 - Bitmanipulation Problems/011 Travelling Salesman Code_en.vtt 14.1 KB
16 - Recursion/003 Fibonacci Series_en.vtt 14.0 KB
24 - Fenwick Trees/006 Inversion Count Using Fenwick Tree_en.vtt 13.9 KB
36 - Advance Dynamic Programming Problems/002 Tabulation vs Memoisation_en.vtt 13.9 KB
25 - Sqrt Decomposition/003 DQUERY SPOJ using Mo's Algorithm_en.vtt 13.9 KB
24 - Fenwick Trees/001 Structure_en.vtt 13.9 KB
24 - Fenwick Trees/004 Code_en.vtt 13.9 KB
36 - Advance Dynamic Programming Problems/015 Coins (code)_en.vtt 13.8 KB
23 - Lazy Propagation/001 Introduction_en.vtt 13.8 KB
18 - Binary Search/005 Angry Birds_en.vtt 13.6 KB
16 - Recursion/001 Recursion Basics_en.vtt 13.6 KB
35 - Classical Dynamic Programming/003 N-K Ladders_en.vtt 13.5 KB
19 - Divide & Conquer/002 Merge Sort Code_en.vtt 13.5 KB
14 - Theorems in Number Theory/002 Modulo Arithmetic Code_en.vtt 13.5 KB
33 - Spanning Trees/001 Dry Run_en.vtt 13.4 KB
11 - Inclusion Exclusion Principle/004 Total Number of Divisors Till N code_en.vtt 13.3 KB
33 - Spanning Trees/005 Kruskal's Code_en.vtt 13.3 KB
17 - Backtracking/010 Sudoku Solver_en.vtt 13.2 KB
08 - Linear Recurrences & Matrix Exponentiation/007 Fibosum(second approach)_en.vtt 13.0 KB
22 - Segment Trees/002 Introduction and Structure_en.vtt 12.9 KB
37 - Pattern String Matching/008 Rabin Karp algorithm Code_en.vtt 12.9 KB
32 - Disjoint Set Union Data Structure/004 DSU Implementation_en.vtt 12.8 KB
12 - Prime Numbers & Factorisation/002 Prime Sieve_en.vtt 12.8 KB
19 - Divide & Conquer/003 Quick Sort_en.vtt 12.7 KB
19 - Divide & Conquer/004 Quick Sort Code_en.vtt 12.7 KB
09 - Pigeonhole Principle/003 Applying Pigeonhole Principle_en.vtt 12.7 KB
39 - Interactive Problems/004 Lost Numbers_en.vtt 12.6 KB
09 - Pigeonhole Principle/004 Gray Similar Code_en.vtt 12.5 KB
24 - Fenwick Trees/003 Update_en.vtt 12.4 KB
36 - Advance Dynamic Programming Problems/017 Sushi (code)_en.vtt 12.3 KB
05 - Bitmanipulation Basics/001 Bitwise Operators_en.vtt 12.2 KB
02 - Setting Up Sublime [Optional]/001 Sublime Setup_en.vtt 12.2 KB
40 - Random Randomisation/001 Randomised Random Function_en.vtt 12.1 KB
02 - Setting Up Sublime [Optional]/005 Using Macros_en.vtt 12.0 KB
25 - Sqrt Decomposition/004 Sorting the queries according to MO's comparator_en.vtt 12.0 KB
31 - Directed Graphs & SCC's/005 Kosaraju Algorithm Code_en.vtt 12.0 KB
35 - Classical Dynamic Programming/010 Box Stacking Problem_en.vtt 12.0 KB
31 - Directed Graphs & SCC's/003 SCC Theory_en.vtt 11.9 KB
22 - Segment Trees/006 Facts and Properties_en.vtt 11.9 KB
16 - Recursion/004 Sorted Array Check_en.vtt 11.9 KB
36 - Advance Dynamic Programming Problems/020 Deque (second solution)_en.vtt 11.9 KB
37 - Pattern String Matching/002 Brute Force Pattern Matching using STL_en.vtt 11.9 KB
08 - Linear Recurrences & Matrix Exponentiation/003 Fast Mutiplication_en.vtt 11.9 KB
15 - Combinatorics/002 Binomial Coefficients_en.vtt 11.8 KB
18 - Binary Search/008 Game of Greed Code_en.vtt 11.6 KB
20 - Greedy Algorithms/004 Activity Selection Busyman_en.vtt 11.5 KB
12 - Prime Numbers & Factorisation/001 Introduction_en.vtt 11.4 KB
36 - Advance Dynamic Programming Problems/022 Candies (code)_en.vtt 11.3 KB
12 - Prime Numbers & Factorisation/003 Sieve of Eratosthenes Code_en.vtt 11.2 KB
17 - Backtracking/004 Permuations_en.vtt 11.2 KB
37 - Pattern String Matching/007 Rolling Hash Rabin Karp Algorithm_en.vtt 11.1 KB
16 - Recursion/012 Tower Of Hanoi (code)_en.vtt 11.1 KB
27 - The Game Of NIM/001 Game of Nim_en.vtt 11.1 KB
29 - Graphs as Trees/003 DFS Trees and Backedges_en.vtt 11.1 KB
25 - Sqrt Decomposition/002 Range queries (Code)_en.vtt 11.0 KB
34 - Shortest Paths Algorithms/002 Dijkstra's Algorithm_en.vtt 11.0 KB
06 - Bitmanipulation Problems/003 Unique Number - II_en.vtt 11.0 KB
28 - Graph Traversals/003 Graph Key Concepts_en.vtt 11.0 KB
08 - Linear Recurrences & Matrix Exponentiation/002 Modular Binary Exponentiation_en.vtt 11.0 KB
14 - Theorems in Number Theory/006 Chinese Remainder Theorem_en.vtt 10.9 KB
39 - Interactive Problems/006 Xor Guessing_en.vtt 10.8 KB
14 - Theorems in Number Theory/008 Totient Function code using Seive_en.vtt 10.7 KB
36 - Advance Dynamic Programming Problems/010 Longest Path_en.vtt 10.6 KB
22 - Segment Trees/005 Update_en.vtt 10.6 KB
14 - Theorems in Number Theory/003 Fermat's Theorem_en.vtt 10.5 KB
13 - Extended Euclidean's Algorithm & Applications/005 Extended Euclidean Example_en.vtt 10.5 KB
18 - Binary Search/006 Angry Bird Code_en.vtt 10.4 KB
36 - Advance Dynamic Programming Problems/012 Grid 1_en.vtt 10.3 KB
07 - Big Integers/003 Big Addition Concept_en.vtt 10.1 KB
06 - Bitmanipulation Problems/006 Unique Number - III Code_en.vtt 10.1 KB
18 - Binary Search/007 Game of Greed_en.vtt 10.1 KB
36 - Advance Dynamic Programming Problems/029 Independent Set (code)_en.vtt 10.1 KB
36 - Advance Dynamic Programming Problems/025 Matching_en.vtt 10.1 KB
03 - Time Space Complexity Analysis/002 Experimental Analysis_en.vtt 10.1 KB
34 - Shortest Paths Algorithms/001 Shortest Path Introduction_en.vtt 10.0 KB
32 - Disjoint Set Union Data Structure/002 DSU Data Structure_en.vtt 10.0 KB
07 - Big Integers/006 Large Factorials_en.vtt 10.0 KB
33 - Spanning Trees/004 Kruskal's Algorithm_en.vtt 9.9 KB
03 - Time Space Complexity Analysis/001 Space Time Complexity Introduction_en.vtt 9.9 KB
32 - Disjoint Set Union Data Structure/005 Union By Rank_en.vtt 9.7 KB
09 - Pigeonhole Principle/002 Problem DIVSUB_en.vtt 9.7 KB
35 - Classical Dynamic Programming/011 Box Stacking Code_en.vtt 9.7 KB
15 - Combinatorics/005 Birthday Paradox_en.vtt 9.7 KB
41 - Policy Based Data Structures/001 Introduction & Applications_en.vtt 9.7 KB
40 - Random Randomisation/002 Run Code for a Particular Time_en.vtt 9.6 KB
26 - Combinatorial Games/002 Combinatorial Games_en.vtt 9.6 KB
18 - Binary Search/001 Binary Search_en.vtt 9.6 KB
15 - Combinatorics/007 Catalan Numbers_en.vtt 9.5 KB
16 - Recursion/005 Understanding Recursion DIrections_en.vtt 9.4 KB
10 - Mathematical Expectation/001 Expectation_en.vtt 9.3 KB
16 - Recursion/002 Factorial_en.vtt 9.3 KB
06 - Bitmanipulation Problems/004 Unique Number - II Code_en.vtt 9.3 KB
28 - Graph Traversals/005 Adjacency List_en.vtt 9.2 KB
42 - CP Guidance/002 Where to practice_en.vtt 9.2 KB
29 - Graphs as Trees/002 DFS on Trees_en.vtt 9.2 KB
32 - Disjoint Set Union Data Structure/006 Path Compression_en.vtt 9.2 KB
28 - Graph Traversals/004 Adjacency List_en.vtt 9.2 KB
13 - Extended Euclidean's Algorithm & Applications/011 Linear Diophantine Equations_en.vtt 9.2 KB
12 - Prime Numbers & Factorisation/010 Segmented Sieve Algorithm_en.vtt 9.1 KB
14 - Theorems in Number Theory/005 nCr % P_en.vtt 9.1 KB
39 - Interactive Problems/005 Lost Numbers (code)_en.vtt 9.0 KB
26 - Combinatorial Games/004 N and P positions_en.vtt 9.0 KB
15 - Combinatorics/004 Computing Binomial Coefficients_en.vtt 8.9 KB
11 - Inclusion Exclusion Principle/002 Generalised Function_en.vtt 8.9 KB
07 - Big Integers/005 Array & Integer Multiplication_en.vtt 8.8 KB
34 - Shortest Paths Algorithms/005 Bellman Ford Code_en.vtt 8.8 KB
24 - Fenwick Trees/005 Inversion Count (Multiple Ways of solving it)_en.vtt 8.8 KB
17 - Backtracking/005 Brackets_en.vtt 8.7 KB
18 - Binary Search/003 Lower Bound and Upper Bound_en.vtt 8.7 KB
38 - Geometric Algorithms - Convex Hull/001 Introduction_en.vtt 8.7 KB
41 - Policy Based Data Structures/003 Using Coding Minutes IDE_en.vtt 8.6 KB
38 - Geometric Algorithms - Convex Hull/005 Problem - Polygon (Codeforces)_en.vtt 8.6 KB
36 - Advance Dynamic Programming Problems/011 Longest Path (code)_en.vtt 8.6 KB
03 - Time Space Complexity Analysis/007 Analayis of BInary Search_en.vtt 8.5 KB
16 - Recursion/009 Count Strings_en.vtt 8.5 KB
04 - Data Structures & STL Containers/005 Deque STL_en.vtt 8.5 KB
01 - Introduction/001 Introduction_en.vtt 8.4 KB
15 - Combinatorics/006 Birthday Paradox Code_en.vtt 8.3 KB
02 - Setting Up Sublime [Optional]/003 Escaping Online Judges_en.vtt 8.3 KB
35 - Classical Dynamic Programming/005 N-K Ladders Bottom Up_en.vtt 8.3 KB
16 - Recursion/008 Tiling Problem_en.vtt 8.2 KB
38 - Geometric Algorithms - Convex Hull/002 Orientation of Points_en.vtt 8.2 KB
12 - Prime Numbers & Factorisation/004 Prime Queries_en.vtt 8.1 KB
36 - Advance Dynamic Programming Problems/014 Coins_en.vtt 8.1 KB
20 - Greedy Algorithms/005 Baised Standings_en.vtt 8.1 KB
08 - Linear Recurrences & Matrix Exponentiation/006 Fibosum (spoj)_en.vtt 8.1 KB
34 - Shortest Paths Algorithms/007 Floyd Warshall Code_en.vtt 8.1 KB
13 - Extended Euclidean's Algorithm & Applications/006 Extended Euclidean Code_en.vtt 8.0 KB
13 - Extended Euclidean's Algorithm & Applications/001 GCD_en.vtt 7.9 KB
17 - Backtracking/003 Finding Subsets Code_en.vtt 7.9 KB
28 - Graph Traversals/006 BFS Concept_en.vtt 7.9 KB
39 - Interactive Problems/003 Guess the Number - code_en.vtt 7.8 KB
28 - Graph Traversals/007 BFS_en.vtt 7.7 KB
32 - Disjoint Set Union Data Structure/003 Union & Find Ops_en.vtt 7.7 KB
06 - Bitmanipulation Problems/001 Unique Number - I_en.vtt 7.6 KB
12 - Prime Numbers & Factorisation/008 Prime Factorisation using Sieve O(LogN)_en.vtt 7.6 KB
13 - Extended Euclidean's Algorithm & Applications/004 Extended Euclideans_en.vtt 7.6 KB
35 - Classical Dynamic Programming/006 Minimum Jums_en.vtt 7.6 KB
17 - Backtracking/006 Brackets Code_en.vtt 7.5 KB
19 - Divide & Conquer/010 Ternary Search - Finding maximaminima of a parabola (Code)_en.vtt 7.5 KB
06 - Bitmanipulation Problems/007 Finding Subsets_en.vtt 7.4 KB
35 - Classical Dynamic Programming/008 Longest Increasing Subsequence_en.vtt 7.3 KB
16 - Recursion/010 Friend's Pairing Problem_en.vtt 7.3 KB
10 - Mathematical Expectation/010 Coupon Collector_en.vtt 7.2 KB
36 - Advance Dynamic Programming Problems/031 Flowers using segment tree_en.vtt 7.0 KB
06 - Bitmanipulation Problems/005 Unique Number - III_en.vtt 6.9 KB
36 - Advance Dynamic Programming Problems/026 Matching continued_en.vtt 6.8 KB
12 - Prime Numbers & Factorisation/007 Prime Factorisation Code O(Sqrt(N))_en.vtt 6.8 KB
20 - Greedy Algorithms/003 Greedy vs DP_en.vtt 6.8 KB
10 - Mathematical Expectation/006 Expected Throws - N Consecutive Heads_en.vtt 6.7 KB
11 - Inclusion Exclusion Principle/001 Inclusion Exclusion_en.vtt 6.6 KB
21 - Meet In The Middle/002 Subsums Code_en.vtt 6.6 KB
05 - Bitmanipulation Basics/009 Clear Range of Bits_en.vtt 6.5 KB
22 - Segment Trees/003 Building_en.vtt 6.5 KB
27 - The Game Of NIM/002 Nim Sum_en.vtt 6.5 KB
02 - Setting Up Sublime [Optional]/004 Common Code Snippets_en.vtt 6.3 KB
04 - Data Structures & STL Containers/008 Priority Queue STL_en.vtt 6.3 KB
13 - Extended Euclidean's Algorithm & Applications/003 GCD Complexity_en.vtt 6.2 KB
03 - Time Space Complexity Analysis/008 Analysis of Merge Sort_en.vtt 6.2 KB
35 - Classical Dynamic Programming/007 Minimum Jumps Code_en.vtt 6.2 KB
07 - Big Integers/011 Big Integer Challenge - Julka_en.vtt 6.2 KB
24 - Fenwick Trees/007 Inversion Count Using Fenwick Tree Code_en.vtt 6.1 KB
36 - Advance Dynamic Programming Problems/034 Walk (code)_en.vtt 6.1 KB
28 - Graph Traversals/009 DFS Code_en.vtt 6.0 KB
07 - Big Integers/012 Big Integer Challenge Solution_en.vtt 6.0 KB
12 - Prime Numbers & Factorisation/005 Prime Factorisation_en.vtt 6.0 KB
28 - Graph Traversals/011 Shortest Path Code_en.vtt 5.9 KB
35 - Classical Dynamic Programming/002 A Note About DP_en.vtt 5.9 KB
06 - Bitmanipulation Problems/008 Finding Subsets Code_en.vtt 5.8 KB
07 - Big Integers/009 Big Integers in Python_en.vtt 5.8 KB
20 - Greedy Algorithms/001 Greedy Introduction_en.vtt 5.7 KB
05 - Bitmanipulation Basics/002 Left Shift & Right Shift_en.vtt 5.7 KB
14 - Theorems in Number Theory/007 Totient Function_en.vtt 5.7 KB
20 - Greedy Algorithms/002 Indian Coin Change_en.vtt 5.5 KB
07 - Big Integers/002 Introduction to Big Integers_en.vtt 5.5 KB
37 - Pattern String Matching/006 Polynomial Hash Code_en.vtt 5.4 KB
05 - Bitmanipulation Basics/007 Update ith Bit_en.vtt 5.4 KB
19 - Divide & Conquer/005 Quick Select_en.vtt 5.4 KB
28 - Graph Traversals/010 Shortest Path_en.vtt 5.4 KB
16 - Recursion/007 Fast Power_en.vtt 5.3 KB
05 - Bitmanipulation Basics/012 Count Bits_en.vtt 5.3 KB
03 - Time Space Complexity Analysis/003 Big O Notation_en.vtt 5.3 KB
05 - Bitmanipulation Basics/010 Replace Bits_en.vtt 5.2 KB
17 - Backtracking/001 Backtracking Problems_en.vtt 5.1 KB
39 - Interactive Problems/007 Xor Guessing (code)_en.vtt 5.1 KB
05 - Bitmanipulation Basics/014 Make it Binary_en.vtt 4.9 KB
32 - Disjoint Set Union Data Structure/001 DSU Introduction_en.vtt 4.9 KB
28 - Graph Traversals/008 DFS_en.vtt 4.8 KB
19 - Divide & Conquer/001 Merge Sort_en.vtt 4.8 KB
13 - Extended Euclidean's Algorithm & Applications/008 Multiplicative Modulo Inverse_en.vtt 4.8 KB
05 - Bitmanipulation Basics/004 Get ith Bit_en.vtt 4.7 KB
19 - Divide & Conquer/008 Inversion Count Code_en.vtt 4.6 KB
06 - Bitmanipulation Problems/010 Travelling Salesman Intution_en.vtt 4.6 KB
10 - Mathematical Expectation/007 Bernaulli's Trial_en.vtt 4.5 KB
05 - Bitmanipulation Basics/013 Count Bits Hack_en.vtt 4.4 KB
05 - Bitmanipulation Basics/008 Clear Last i Bits_en.vtt 4.3 KB
03 - Time Space Complexity Analysis/006 Analysis of Bubble Sort_en.vtt 4.3 KB
13 - Extended Euclidean's Algorithm & Applications/007 GCD using Extended Euclidean Algorithm_en.vtt 4.2 KB
18 - Binary Search/002 Binary Search Code_en.vtt 4.2 KB
23 - Lazy Propagation/004 Bug and Code Continued_en.vtt 4.2 KB
35 - Classical Dynamic Programming/004 N-K Ladders Top Down_en.vtt 4.2 KB
03 - Time Space Complexity Analysis/010 Complexities for Worst Case AC_en.vtt 4.2 KB
15 - Combinatorics/009 Catalan Numbers Code - Iterative DP_en.vtt 4.1 KB
13 - Extended Euclidean's Algorithm & Applications/010 MMI Code_en.vtt 4.1 KB
16 - Recursion/006 Power Function_en.vtt 4.1 KB
03 - Time Space Complexity Analysis/009 Avoiding TLE Errors_en.vtt 4.0 KB
07 - Big Integers/008 BigInteger Example_en.vtt 4.0 KB
12 - Prime Numbers & Factorisation/009 Segmented Sieve_en.vtt 3.9 KB
10 - Mathematical Expectation/002 Linearity of Expectation_en.vtt 3.9 KB
36 - Advance Dynamic Programming Problems/013 Grid 1 (code)_en.vtt 3.9 KB
10 - Mathematical Expectation/005 Expected Throws - Two Consecutive Heads_en.vtt 3.9 KB
02 - Setting Up Sublime [Optional]/002 Adding Master Header File_en.vtt 3.9 KB
05 - Bitmanipulation Basics/003 Odd Even_en.vtt 3.9 KB
10 - Mathematical Expectation/004 Expected Throws - One Head_en.vtt 3.8 KB
13 - Extended Euclidean's Algorithm & Applications/009 Computing Multiplicative Modulo Inverse_en.vtt 3.7 KB
09 - Pigeonhole Principle/001 Pigeonhole Principle_en.vtt 3.7 KB
04 - Data Structures & STL Containers/006 Stack STL_en.vtt 3.6 KB
19 - Divide & Conquer/006 Quick Select Code_en.vtt 3.3 KB
06 - Bitmanipulation Problems/012 Travelling Salesman - DP Optimisation_en.vtt 3.3 KB
05 - Bitmanipulation Basics/011 Two Power_en.vtt 3.3 KB
18 - Binary Search/004 Lower Bound Code_en.vtt 3.3 KB
12 - Prime Numbers & Factorisation/006 Prime Factorisation Code O(N)_en.vtt 3.2 KB
14 - Theorems in Number Theory/004 Factorial % P_en.vtt 3.2 KB
03 - Time Space Complexity Analysis/005 Nested Loops - II_en.vtt 3.2 KB
13 - Extended Euclidean's Algorithm & Applications/012 Linear Diophantine Equation - Family of Solutions_en.vtt 3.1 KB
13 - Extended Euclidean's Algorithm & Applications/002 Euclid's Algorithm Code_en.vtt 3.1 KB
05 - Bitmanipulation Basics/005 Clear ith Bit_en.vtt 3.1 KB
35 - Classical Dynamic Programming/009 Longest Increasing Subsequence Code_en.vtt 3.0 KB
15 - Combinatorics/008 Catalan Numbers Code - Recursive_en.vtt 3.0 KB
05 - Bitmanipulation Basics/006 Set ith Bit_en.vtt 2.9 KB
03 - Time Space Complexity Analysis/004 Nested Loops_en.vtt 2.9 KB
10 - Mathematical Expectation/003 Problem - Linearity of Expectation_en.vtt 2.8 KB
10 - Mathematical Expectation/009 Bernoulli's Trial_en.vtt 2.7 KB
23 - Lazy Propagation/004 segment-tree-with-lazy-propagation.cpp 2.7 KB
01 - Introduction/004 Doubt Support.html 2.7 KB
28 - Graph Traversals/013 board-game.cpp 2.2 KB
01 - Introduction/002 Course Structure.html 2.2 KB
01 - Introduction/006 FAQ's.html 2.1 KB
02 - Setting Up Sublime [Optional]/006 saurabh-code.cpp 2.1 KB
08 - Linear Recurrences & Matrix Exponentiation/005 spp.cpp 2.0 KB
06 - Bitmanipulation Problems/002 Unique Number - I Code_en.vtt 1.9 KB
38 - Geometric Algorithms - Convex Hull/004 graham-scan-convex-hull.cpp 1.9 KB
38 - Geometric Algorithms - Convex Hull/005 convex-hull-include-collinear-points.cpp 1.9 KB
22 - Segment Trees/007 segment-tree.cpp 1.9 KB
36 - Advance Dynamic Programming Problems/032 flowers.cpp 1.9 KB
32 - Disjoint Set Union Data Structure/006 dsu-rank-path-compression.cpp 1.6 KB
33 - Spanning Trees/005 kruskal-code.cpp 1.6 KB
04 - Data Structures & STL Containers/007 Queue STL_en.vtt 1.6 KB
32 - Disjoint Set Union Data Structure/004 dsu-2.cpp 1.5 KB
30 - Lowest Common Ancestors/003 LCA-using-sparse-table.cpp 1.5 KB
17 - Backtracking/011 Sudoku.cpp 1.5 KB
10 - Mathematical Expectation/008 Choose Number_en.vtt 1.5 KB
34 - Shortest Paths Algorithms/003 dijkstra.cpp 1.4 KB
25 - Sqrt Decomposition/006 dquery-spoj.cpp 1.4 KB
28 - Graph Traversals/011 03-bfs-shortest-path.cpp 1.4 KB
17 - Backtracking/008 n-queen-print-one.cpp 1.4 KB
09 - Pigeonhole Principle/006 HOLI.cpp 1.4 KB
36 - Advance Dynamic Programming Problems/039 permutation.cpp 1.4 KB
17 - Backtracking/009 n-queen-all-ways.cpp 1.4 KB
37 - Pattern String Matching/008 rabin-carp.cpp 1.2 KB
33 - Spanning Trees/003 prims-code.cpp 1.2 KB
07 - Big Integers/004 big-addition.cpp 1.2 KB
12 - Prime Numbers & Factorisation/011 segmented-sieve.cpp 1.2 KB
32 - Disjoint Set Union Data Structure/004 dsu-1.cpp 1.2 KB
13 - Extended Euclidean's Algorithm & Applications/009 mmi.cpp 1.1 KB
13 - Extended Euclidean's Algorithm & Applications/010 mmi.cpp 1.1 KB
36 - Advance Dynamic Programming Problems/017 sushi.cpp 1.1 KB
19 - Divide & Conquer/008 02-inversion-count.cpp 1.1 KB
08 - Linear Recurrences & Matrix Exponentiation/007 fibosum-2.cpp 1.1 KB
21 - Meet In The Middle/002 subsums-spoj.cpp 1.1 KB
31 - Directed Graphs & SCC's/005 kosaraju-algorithm-for-SCC.cpp 1.1 KB
36 - Advance Dynamic Programming Problems/022 candies.cpp 1.0 KB
36 - Advance Dynamic Programming Problems/007 knapsack-2.cpp 1.0 KB
34 - Shortest Paths Algorithms/005 bellman-ford.cpp 1.0 KB
19 - Divide & Conquer/002 01-mergesort-vector.cpp 1.0 KB
36 - Advance Dynamic Programming Problems/034 walk.cpp 1.0 KB
24 - Fenwick Trees/007 inversion-count-using-fenwick-tree.cpp 1018 bytes
37 - Pattern String Matching/003 Trie.cpp 1004 bytes
28 - Graph Traversals/005 02-adj-list-node.cpp 1003 bytes
08 - Linear Recurrences & Matrix Exponentiation/006 fibosum.cpp 1000 bytes
12 - Prime Numbers & Factorisation/008 prime-factorisation-using-sieve.cpp 995 bytes
36 - Advance Dynamic Programming Problems/019 deque-1.cpp 993 bytes
37 - Pattern String Matching/004 trie-pattern-matching.cpp 993 bytes
30 - Lowest Common Ancestors/002 LCA-using-2-pointers.cpp 985 bytes
36 - Advance Dynamic Programming Problems/009 LCS.cpp 938 bytes
34 - Shortest Paths Algorithms/007 floyd-warshall.cpp 936 bytes
24 - Fenwick Trees/004 fenwick-tree.cpp 905 bytes
28 - Graph Traversals/007 03-bfs.cpp 894 bytes
36 - Advance Dynamic Programming Problems/004 Frog-2-tracing.cpp 892 bytes
08 - Linear Recurrences & Matrix Exponentiation/005 matrix-exponentiation.cpp 884 bytes
36 - Advance Dynamic Programming Problems/015 Coins.cpp 872 bytes
36 - Advance Dynamic Programming Problems/029 independet-set.cpp 868 bytes
36 - Advance Dynamic Programming Problems/006 knapsack-1.cpp 856 bytes
15 - Combinatorics/003 P & C Formulas.html 842 bytes
18 - Binary Search/006 04-angry-birds.cpp 799 bytes
28 - Graph Traversals/009 04-dfs.cpp 792 bytes
13 - Extended Euclidean's Algorithm & Applications/006 extended-gcd.cpp 782 bytes
13 - Extended Euclidean's Algorithm & Applications/007 extended-gcd.cpp 782 bytes
36 - Advance Dynamic Programming Problems/036 digit-sum.cpp 776 bytes
11 - Inclusion Exclusion Principle/004 total-divisors-inclusion.cpp 750 bytes
36 - Advance Dynamic Programming Problems/024 slimes.cpp 750 bytes
39 - Interactive Problems/005 lost-numbers.cpp 748 bytes
12 - Prime Numbers & Factorisation/006 prime-factorisation.cpp 747 bytes
12 - Prime Numbers & Factorisation/007 prime-factorisation.cpp 747 bytes
36 - Advance Dynamic Programming Problems/013 Grid-1.cpp 730 bytes
36 - Advance Dynamic Programming Problems/005 vacation.cpp 728 bytes
14 - Theorems in Number Theory/008 totient.cpp 725 bytes
25 - Sqrt Decomposition/004 sorting-based-on-mos.cpp 712 bytes
36 - Advance Dynamic Programming Problems/011 Longest-Path.cpp 706 bytes
19 - Divide & Conquer/006 04-quickselect.cpp 699 bytes
12 - Prime Numbers & Factorisation/003 prime.cpp 685 bytes
12 - Prime Numbers & Factorisation/004 prime-queries.cpp 685 bytes
07 - Big Integers/006 big-factorial.cpp 683 bytes
39 - Interactive Problems/007 Xor-guessing.cpp 683 bytes
06 - Bitmanipulation Problems/006 unique-3.cpp 682 bytes
06 - Bitmanipulation Problems/004 unique-2.cpp 678 bytes
31 - Directed Graphs & SCC's/002 topological-Order.cpp 672 bytes
29 - Graphs as Trees/004 DFS-tree-and-backedge-code.cpp 668 bytes
28 - Graph Traversals/004 01-adj-list.cpp 664 bytes
36 - Advance Dynamic Programming Problems/020 deque-2.cpp 659 bytes
36 - Advance Dynamic Programming Problems/003 Frog1-recursive.cpp 640 bytes
19 - Divide & Conquer/004 03-quicksort.cpp 625 bytes
15 - Combinatorics/002 binomial-coefficient.cpp 614 bytes
25 - Sqrt Decomposition/002 sqrt-deecomposition.cpp 608 bytes
18 - Binary Search/002 binary-search.cpp 602 bytes
29 - Graphs as Trees/002 ancestor-printing.cpp 587 bytes
36 - Advance Dynamic Programming Problems/003 Frog-1-tabulation.cpp 557 bytes
01 - Introduction/005 IDE Environment Setup.html 553 bytes
19 - Divide & Conquer/010 ternary-search.cpp 536 bytes
16 - Recursion/012 tower-of-hanoi.cpp 511 bytes
41 - Policy Based Data Structures/003 Policy-based-ds.cpp 507 bytes
41 - Policy Based Data Structures/004 inversion-count-using-PBDS.cpp 507 bytes
16 - Recursion/004 sorted-array.cpp 502 bytes
06 - Bitmanipulation Problems/008 subsets.cpp 497 bytes
17 - Backtracking/003 subsets.cpp 497 bytes
05 - Bitmanipulation Basics/012 counting-bits.cpp 479 bytes
40 - Random Randomisation/002 random-and-time.cpp 478 bytes
17 - Backtracking/006 generate-brackets.cpp 440 bytes
16 - Recursion/006 power.cpp 419 bytes
15 - Combinatorics/005 birthday-paradox.cpp 408 bytes
15 - Combinatorics/006 birthday-paradox.cpp 408 bytes
15 - Combinatorics/010 OEIS.html 403 bytes
08 - Linear Recurrences & Matrix Exponentiation/002 modular-exponentiation.cpp 361 bytes
08 - Linear Recurrences & Matrix Exponentiation/003 fast-multiplication.cpp 360 bytes
06 - Bitmanipulation Problems/002 unique-1.cp 322 bytes
16 - Recursion/007 fast-exponentiation.cpp 306 bytes
07 - Big Integers/010 Python's Handling of Big Integers.html 303 bytes
08 - Linear Recurrences & Matrix Exponentiation/001 binary-exponentiation.cpp 296 bytes
05 - Bitmanipulation Basics/014 decimal-to-binary.cpp 282 bytes
01 - Introduction/003 Exercise Solutions (C++Java).html 273 bytes
16 - Recursion/002 factorial.cpp 205 bytes
16 - Recursion/003 fibonacci.cpp 205 bytes
13 - Extended Euclidean's Algorithm & Applications/001 gcd.cpp 189 bytes
13 - Extended Euclidean's Algorithm & Applications/002 gcd.cpp 189 bytes
05 - Bitmanipulation Basics/011 power-of-2.cpp 174 bytes
04 - Data Structures & STL Containers/009 [Webinar] Hashing STL.html 163 bytes
04 - Data Structures & STL Containers/010 [Webinar] More on STL.html 154 bytes
05 - Bitmanipulation Basics/003 odd.cpp 142 bytes
08 - Linear Recurrences & Matrix Exponentiation/Download Paid Udemy Courses For Free.url 116 bytes
08 - Linear Recurrences & Matrix Exponentiation/GetFreeCourses.Co.url 116 bytes
14 - Theorems in Number Theory/Download Paid Udemy Courses For Free.url 116 bytes
14 - Theorems in Number Theory/GetFreeCourses.Co.url 116 bytes
30 - Lowest Common Ancestors/Download Paid Udemy Courses For Free.url 116 bytes
Download Paid Udemy Courses For Free.url 116 bytes
GetFreeCourses.Co.url 116 bytes
05 - Bitmanipulation Basics/001 bitwise.cpp 104 bytes
26 - Combinatorial Games/001 Game Theory Introduction.html 94 bytes
37 - Pattern String Matching/001 Introduction to Advanced Module!.html 67 bytes
15 - Combinatorics/011 Introduction to Algorithms.html 60 bytes
22 - Segment Trees/001 Introduction to Range Queries.html 58 bytes
28 - Graph Traversals/001 Graphs Introduction.html 56 bytes
07 - Big Integers/001 Welcome!.html 31 bytes

GetFreeCourses.Co-Udemy-Competitive Programming Essentials, Master Algorithms 2022

File List

Download Torrent

Related Resources

Copyright Infringement