| 01 - Introduction | |||
| 001 Introduction.mp4 | 86.75 MB | ||
| 001 Introduction_en.vtt | 8.38 KB | ||
| 002 Course Structure.html | 2.2 KB | ||
| 003 Exercise Solutions (C++Java).html | 273 B | ||
| 004 Doubt Support.html | 2.7 KB | ||
| 005 IDE Environment Setup.html | 553 B | ||
| 006 FAQ's.html | 2.15 KB | ||
| 02 - Setting Up Sublime [Optional] | |||
| 001 Sublime Setup.mp4 | 91.21 MB | ||
| 001 Sublime Setup_en.vtt | 12.17 KB | ||
| 002 Adding Master Header File.mp4 | 32.06 MB | ||
| 002 Adding Master Header File_en.vtt | 3.86 KB | ||
| 003 Escaping Online Judges.mp4 | 18.3 MB | ||
| 003 Escaping Online Judges_en.vtt | 8.3 KB | ||
| 004 Common Code Snippets.mp4 | 46.09 MB | ||
| 004 Common Code Snippets_en.vtt | 6.32 KB | ||
| 005 Using Macros.mp4 | 26.82 MB | ||
| 005 Using Macros_en.vtt | 12.05 KB | ||
| 006 Example Code Explained.mp4 | 149.83 MB | ||
| 006 Example Code Explained_en.vtt | 23.69 KB | ||
| 006 saurabh-code.cpp | 2.11 KB | ||
| 03 - Time Space Complexity Analysis | |||
| 001 Space Time Complexity Introduction.mp4 | 97.64 MB | ||
| 001 Space Time Complexity Introduction_en.vtt | 9.86 KB | ||
| 002 Experimental Analysis.mp4 | 42.03 MB | ||
| 002 Experimental Analysis_en.vtt | 10.08 KB | ||
| 003 Big O Notation.mp4 | 10.8 MB | ||
| 003 Big O Notation_en.vtt | 5.27 KB | ||
| 004 Nested Loops.mp4 | 5.98 MB | ||
| 004 Nested Loops_en.vtt | 2.9 KB | ||
| 005 Nested Loops - II.mp4 | 6.58 MB | ||
| 005 Nested Loops - II_en.vtt | 3.19 KB | ||
| 006 Analysis of Bubble Sort.mp4 | 9.3 MB | ||
| 006 Analysis of Bubble Sort_en.vtt | 4.28 KB | ||
| 007 Analayis of BInary Search.mp4 | 18.13 MB | ||
| 007 Analayis of BInary Search_en.vtt | 8.55 KB | ||
| 008 Analysis of Merge Sort.mp4 | 14.49 MB | ||
| 008 Analysis of Merge Sort_en.vtt | 6.22 KB | ||
| 009 Avoiding TLE Errors.mp4 | 7.89 MB | ||
| 009 Avoiding TLE Errors_en.vtt | 4.05 KB | ||
| 010 Complexities for Worst Case AC.mp4 | 7.55 MB | ||
| 010 Complexities for Worst Case AC_en.vtt | 4.17 KB | ||
| 04 - Data Structures & STL Containers | |||
| 001 Data Structures & STL Containers Revisited.mp4 | 89.5 MB | ||
| 001 Data Structures & STL Containers Revisited_en.vtt | 16.73 KB | ||
| 002 Arrays in C++.mp4 | 43.17 MB | ||
| 002 Arrays in C++_en.vtt | 14.61 KB | ||
| 003 Array STL.mp4 | 51.73 MB | ||
| 003 Array STL_en.vtt | 17.13 KB | ||
| 004 Vector STL.mp4 | 43.93 MB | ||
| 004 Vector STL_en.vtt | 21.67 KB | ||
| 005 Deque STL.mp4 | 50.27 MB | ||
| 005 Deque STL_en.vtt | 8.47 KB | ||
| 006 Stack STL.mp4 | 7.76 MB | ||
| 006 Stack STL_en.vtt | 3.64 KB | ||
| 007 Queue STL.mp4 | 4.61 MB | ||
| 007 Queue STL_en.vtt | 1.57 KB | ||
| 008 Priority Queue STL.mp4 | 13.71 MB | ||
| 008 Priority Queue STL_en.vtt | 6.3 KB | ||
| 009 [Webinar] Hashing STL.html | 163 B | ||
| 010 [Webinar] More on STL.html | 154 B | ||
| 05 - Bitmanipulation Basics | |||
| 001 Bitwise Operators.mp4 | 21.91 MB | ||
| 001 Bitwise Operators_en.vtt | 12.2 KB | ||
| 001 bitwise.cpp | 104 B | ||
| 002 Left Shift & Right Shift.mp4 | 9.2 MB | ||
| 002 Left Shift & Right Shift_en.vtt | 5.72 KB | ||
| 003 Odd Even.mp4 | 7.32 MB | ||
| 003 Odd Even_en.vtt | 3.86 KB | ||
| 003 odd.cpp | 142 B | ||
| 004 Get ith Bit.mp4 | 10.23 MB | ||
| 004 Get ith Bit_en.vtt | 4.67 KB | ||
| 005 Clear ith Bit.mp4 | 7.96 MB | ||
| 005 Clear ith Bit_en.vtt | 3.08 KB | ||
| 006 Set ith Bit.mp4 | 10.99 MB | ||
| 006 Set ith Bit_en.vtt | 2.93 KB | ||
| 007 Update ith Bit.mp4 | 18.26 MB | ||
| 007 Update ith Bit_en.vtt | 5.38 KB | ||
| 008 Clear Last i Bits.mp4 | 11.62 MB | ||
| 008 Clear Last i Bits_en.vtt | 4.34 KB | ||
| 009 Clear Range of Bits.mp4 | 17.44 MB | ||
| 009 Clear Range of Bits_en.vtt | 6.55 KB | ||
| 010 Replace Bits.mp4 | 13.8 MB | ||
| 010 Replace Bits_en.vtt | 5.23 KB | ||
| 011 Two Power.mp4 | 7.83 MB | ||
| 011 Two Power_en.vtt | 3.27 KB | ||
| 011 power-of-2.cpp | 174 B | ||
| 012 Count Bits.mp4 | 14.91 MB | ||
| 012 Count Bits_en.vtt | 5.29 KB | ||
| 012 counting-bits.cpp | 479 B | ||
| 013 Count Bits Hack.mp4 | 11.38 MB | ||
| 013 Count Bits Hack_en.vtt | 4.44 KB | ||
| 014 Make it Binary.mp4 | 14.27 MB | ||
| 014 Make it Binary_en.vtt | 4.91 KB | ||
| 014 decimal-to-binary.cpp | 282 B | ||
| 06 - Bitmanipulation Problems | |||
| 001 Unique Number - I.mp4 | 16.86 MB | ||
| 001 Unique Number - I_en.vtt | 7.64 KB | ||
| 002 Unique Number - I Code.mp4 | 3.32 MB | ||
| 002 Unique Number - I Code_en.vtt | 1.94 KB | ||
| 002 unique-1.cp | 322 B | ||
| 003 Unique Number - II.mp4 | 22.37 MB | ||
| 003 Unique Number - II_en.vtt | 10.98 KB | ||
| 004 Unique Number - II Code.mp4 | 18.74 MB | ||
| 004 Unique Number - II Code_en.vtt | 9.28 KB | ||
| 004 unique-2.cpp | 678 B | ||
| 005 Unique Number - III.mp4 | 60.2 MB | ||
| 005 Unique Number - III_en.vtt | 6.92 KB | ||
| 006 Unique Number - III Code.mp4 | 21.48 MB | ||
| 006 Unique Number - III Code_en.vtt | 10.12 KB | ||
| 006 unique-3.cpp | 682 B | ||
| 007 Finding Subsets.mp4 | 13.72 MB | ||
| 007 Finding Subsets_en.vtt | 7.38 KB | ||
| 008 Finding Subsets Code.mp4 | 12.42 MB | ||
| 008 Finding Subsets Code_en.vtt | 5.84 KB | ||
| 008 subsets.cpp | 497 B | ||
| 009 Travelling Salesman Problem.mp4 | 34.78 MB | ||
| 009 Travelling Salesman Problem_en.vtt | 14.22 KB | ||
| 010 Travelling Salesman Intution.mp4 | 11.03 MB | ||
| 010 Travelling Salesman Intution_en.vtt | 4.56 KB | ||
| 011 Travelling Salesman Code.mp4 | 39.89 MB | ||
| 011 Travelling Salesman Code_en.vtt | 14.1 KB | ||
| 012 Travelling Salesman - DP Optimisation.mp4 | 9.32 MB | ||
| 012 Travelling Salesman - DP Optimisation_en.vtt | 3.27 KB | ||
| 07 - Big Integers | |||
| 001 Welcome!.html | 31 B | ||
| 002 Introduction to Big Integers.mp4 | 10.28 MB | ||
| 002 Introduction to Big Integers_en.vtt | 5.51 KB | ||
| 003 Big Addition Concept.mp4 | 19.74 MB | ||
| 003 Big Addition Concept_en.vtt | 10.15 KB | ||
| 004 Big Addition Code.mp4 | 29.62 MB | ||
| 004 Big Addition Code_en.vtt | 14.91 KB | ||
| 004 big-addition.cpp | 1.19 KB | ||
| 005 Array & Integer Multiplication.mp4 | 15.81 MB | ||
| 005 Array & Integer Multiplication_en.vtt | 8.77 KB | ||
| 006 Large Factorials.mp4 | 24.61 MB | ||
| 006 Large Factorials_en.vtt | 9.97 KB | ||
| 006 big-factorial.cpp | 683 B | ||
| 007 Java Big Integer Class.mp4 | 74.63 MB | ||
| 007 Java Big Integer Class_en.vtt | 16.04 KB | ||
| 008 BigInteger Example.mp4 | 7.39 MB | ||
| 008 BigInteger Example_en.vtt | 3.98 KB | ||
| 009 Big Integers in Python.mp4 | 11.95 MB | ||
| 009 Big Integers in Python_en.vtt | 5.8 KB | ||
| 010 Python's Handling of Big Integers.html | 303 B | ||
| 011 Big Integer Challenge - Julka.mp4 | 54.61 MB | ||
| 011 Big Integer Challenge - Julka_en.vtt | 6.17 KB | ||
| 012 Big Integer Challenge Solution.mp4 | 30.42 MB | ||
| 012 Big Integer Challenge Solution_en.vtt | 6 KB | ||
| 08 - Linear Recurrences & Matrix Exponentiation | |||
| 001 Binary Exponentiation.mp4 | 103.55 MB | ||
| 001 Binary Exponentiation_en.vtt | 18.02 KB | ||
| 001 binary-exponentiation.cpp | 296 B | ||
| 002 Modular Binary Exponentiation.mp4 | 25.08 MB | ||
| 002 Modular Binary Exponentiation_en.vtt | 10.95 KB | ||
| 002 modular-exponentiation.cpp | 361 B | ||
| 003 Fast Mutiplication.mp4 | 38.32 MB | ||
| 003 Fast Mutiplication_en.vtt | 11.86 KB | ||
| 003 fast-multiplication.cpp | 360 B | ||
| 004 Matrix Exponentiation Introduction.mp4 | 172.21 MB | ||
| 004 Matrix Exponentiation Introduction_en.vtt | 17.57 KB | ||
| 005 Matrix Exponentiation Code.mp4 | 173.47 MB | ||
| 005 Matrix Exponentiation Code_en.vtt | 16.26 KB | ||
| 005 matrix-exponentiation.cpp | 884 B | ||
| 005 spp.cpp | 2 KB | ||
| 006 Fibosum (spoj).mp4 | 47.92 MB | ||
| 006 Fibosum (spoj)_en.vtt | 8.09 KB | ||
| 006 fibosum.cpp | 1000 B | ||
| 007 Fibosum(second approach).mp4 | 75.43 MB | ||
| 007 Fibosum(second approach)_en.vtt | 13.04 KB | ||
| 007 fibosum-2.cpp | 1.08 KB | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| 09 - Pigeonhole Principle | |||
| 001 Pigeonhole Principle.mp4 | 7.1 MB | ||
| 001 Pigeonhole Principle_en.vtt | 3.65 KB | ||
| 002 Problem DIVSUB.mp4 | 36.49 MB | ||
| 002 Problem DIVSUB_en.vtt | 9.7 KB | ||
| 003 Applying Pigeonhole Principle.mp4 | 28.4 MB | ||
| 003 Applying Pigeonhole Principle_en.vtt | 12.67 KB | ||
| 004 Gray Similar Code.mp4 | 43.65 MB | ||
| 004 Gray Similar Code_en.vtt | 12.47 KB | ||
| 005 Holiday.mp4 | 241.12 MB | ||
| 005 Holiday_en.vtt | 26.57 KB | ||
| 006 HOLI.cpp | 1.36 KB | ||
| 006 Holiday Code.mp4 | 75.29 MB | ||
| 006 Holiday Code_en.vtt | 17.86 KB | ||
| 10 - Mathematical Expectation | |||
| 001 Expectation.mp4 | 51.48 MB | ||
| 001 Expectation_en.vtt | 9.34 KB | ||
| 002 Linearity of Expectation.mp4 | 6.87 MB | ||
| 002 Linearity of Expectation_en.vtt | 3.89 KB | ||
| 003 Problem - Linearity of Expectation.mp4 | 4.07 MB | ||
| 003 Problem - Linearity of Expectation_en.vtt | 2.82 KB | ||
| 004 Expected Throws - One Head.mp4 | 8.76 MB | ||
| 004 Expected Throws - One Head_en.vtt | 3.75 KB | ||
| 005 Expected Throws - Two Consecutive Heads.mp4 | 8.74 MB | ||
| 005 Expected Throws - Two Consecutive Heads_en.vtt | 3.86 KB | ||
| 006 Expected Throws - N Consecutive Heads.mp4 | 9.96 MB | ||
| 006 Expected Throws - N Consecutive Heads_en.vtt | 6.7 KB | ||
| 007 Bernaulli's Trial.mp4 | 8.13 MB | ||
| 007 Bernaulli's Trial_en.vtt | 4.54 KB | ||
| 008 Choose Number.mp4 | 2.36 MB | ||
| 008 Choose Number_en.vtt | 1.48 KB | ||
| 009 Bernoulli's Trial.mp4 | 4.89 MB | ||
| 009 Bernoulli's Trial_en.vtt | 2.74 KB | ||
| 010 Coupon Collector.mp4 | 10.6 MB | ||
| 010 Coupon Collector_en.vtt | 7.16 KB | ||
| 11 - Inclusion Exclusion Principle | |||
| 001 Inclusion Exclusion.mp4 | 36.3 MB | ||
| 001 Inclusion Exclusion_en.vtt | 6.62 KB | ||
| 002 Generalised Function.mp4 | 32.95 MB | ||
| 002 Generalised Function_en.vtt | 8.85 KB | ||
| 003 Problems.mp4 | 97.14 MB | ||
| 003 Problems_en.vtt | 17.06 KB | ||
| 004 Total Number of Divisors Till N code.mp4 | 106.79 MB | ||
| 004 Total Number of Divisors Till N code_en.vtt | 13.33 KB | ||
| 004 total-divisors-inclusion.cpp | 750 B | ||
| 12 - Prime Numbers & Factorisation | |||
| 001 Introduction.mp4 | 28.01 MB | ||
| 001 Introduction_en.vtt | 11.38 KB | ||
| 002 Prime Sieve.mp4 | 112.61 MB | ||
| 002 Prime Sieve_en.vtt | 12.76 KB | ||
| 003 Sieve of Eratosthenes Code.mp4 | 47.15 MB | ||
| 003 Sieve of Eratosthenes Code_en.vtt | 11.24 KB | ||
| 003 prime.cpp | 685 B | ||
| 004 Prime Queries.mp4 | 15.79 MB | ||
| 004 Prime Queries_en.vtt | 8.15 KB | ||
| 004 prime-queries.cpp | 685 B | ||
| 005 Prime Factorisation.mp4 | 7.24 MB | ||
| 005 Prime Factorisation_en.vtt | 5.97 KB | ||
| 006 Prime Factorisation Code O(N).mp4 | 5.69 MB | ||
| 006 Prime Factorisation Code O(N)_en.vtt | 3.24 KB | ||
| 006 prime-factorisation.cpp | 747 B | ||
| 007 Prime Factorisation Code O(Sqrt(N)).mp4 | 15.31 MB | ||
| 007 Prime Factorisation Code O(Sqrt(N))_en.vtt | 6.78 KB | ||
| 007 prime-factorisation.cpp | 747 B | ||
| 008 Prime Factorisation using Sieve O(LogN).mp4 | 22.66 MB | ||
| 008 Prime Factorisation using Sieve O(LogN)_en.vtt | 7.62 KB | ||
| 008 prime-factorisation-using-sieve.cpp | 995 B | ||
| 009 Segmented Sieve.mp4 | 9.84 MB | ||
| 009 Segmented Sieve_en.vtt | 3.92 KB | ||
| 010 Segmented Sieve Algorithm.mp4 | 15.06 MB | ||
| 010 Segmented Sieve Algorithm_en.vtt | 9.13 KB | ||
| 011 Segmented Sieve Code.mp4 | 34.71 MB | ||
| 011 Segmented Sieve Code_en.vtt | 15.9 KB | ||
| 011 segmented-sieve.cpp | 1.17 KB | ||
| 13 - Extended Euclidean's Algorithm & Applications | |||
| 001 GCD.mp4 | 18.36 MB | ||
| 001 GCD_en.vtt | 7.94 KB | ||
| 001 gcd.cpp | 189 B | ||
| 002 Euclid's Algorithm Code.mp4 | 6.31 MB | ||
| 002 Euclid's Algorithm Code_en.vtt | 3.11 KB | ||
| 002 gcd.cpp | 189 B | ||
| 003 GCD Complexity.mp4 | 8.43 MB | ||
| 003 GCD Complexity_en.vtt | 6.24 KB | ||
| 004 Extended Euclideans.mp4 | 11.17 MB | ||
| 004 Extended Euclideans_en.vtt | 7.57 KB | ||
| 005 Extended Euclidean Example.mp4 | 18.68 MB | ||
| 005 Extended Euclidean Example_en.vtt | 10.53 KB | ||
| 006 Extended Euclidean Code.mp4 | 20.22 MB | ||
| 006 Extended Euclidean Code_en.vtt | 8.04 KB | ||
| 006 extended-gcd.cpp | 782 B | ||
| 007 GCD using Extended Euclidean Algorithm.mp4 | 11.55 MB | ||
| 007 GCD using Extended Euclidean Algorithm_en.vtt | 4.21 KB | ||
| 007 extended-gcd.cpp | 782 B | ||
| 008 Multiplicative Modulo Inverse.mp4 | 10.01 MB | ||
| 008 Multiplicative Modulo Inverse_en.vtt | 4.8 KB | ||
| 009 Computing Multiplicative Modulo Inverse.mp4 | 8.6 MB | ||
| 009 Computing Multiplicative Modulo Inverse_en.vtt | 3.69 KB | ||
| 009 mmi.cpp | 1.13 KB | ||
| 010 MMI Code.mp4 | 10.15 MB | ||
| 010 MMI Code_en.vtt | 4.13 KB | ||
| 010 mmi.cpp | 1.13 KB | ||
| 011 Linear Diophantine Equations.mp4 | 17.47 MB | ||
| 011 Linear Diophantine Equations_en.vtt | 9.16 KB | ||
| 012 Linear Diophantine Equation - Family of Solutions.mp4 | 4.27 MB | ||
| 012 Linear Diophantine Equation - Family of Solutions_en.vtt | 3.13 KB | ||
| 14 - Theorems in Number Theory | |||
| 001 Modulo Airthmetic.mp4 | 87.54 MB | ||
| 001 Modulo Airthmetic_en.vtt | 14.82 KB | ||
| 002 Modulo Arithmetic Code.mp4 | 81.55 MB | ||
| 002 Modulo Arithmetic Code_en.vtt | 13.46 KB | ||
| 003 Fermat's Theorem.mp4 | 66.29 MB | ||
| 003 Fermat's Theorem_en.vtt | 10.54 KB | ||
| 004 Factorial % P.mp4 | 11.62 MB | ||
| 004 Factorial % P_en.vtt | 3.21 KB | ||
| 005 nCr % P.mp4 | 79.55 MB | ||
| 005 nCr % P_en.vtt | 9.1 KB | ||
| 006 Chinese Remainder Theorem.mp4 | 18.49 MB | ||
| 006 Chinese Remainder Theorem_en.vtt | 10.87 KB | ||
| 007 Totient Function.mp4 | 18.35 MB | ||
| 007 Totient Function_en.vtt | 5.68 KB | ||
| 008 Totient Function code using Seive.mp4 | 28.52 MB | ||
| 008 Totient Function code using Seive_en.vtt | 10.68 KB | ||
| 008 totient.cpp | 725 B | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| 15 - Combinatorics | |||
| 001 Combinatorics Introduction.mp4 | 34.74 MB | ||
| 001 Combinatorics Introduction_en.vtt | 14.89 KB | ||
| 002 Binomial Coefficients.mp4 | 22.12 MB | ||
| 002 Binomial Coefficients_en.vtt | 11.77 KB | ||
| 002 binomial-coefficient.cpp | 614 B | ||
| 003 P & C Formulas.html | 842 B | ||
| 004 Computing Binomial Coefficients.mp4 | 19.02 MB | ||
| 004 Computing Binomial Coefficients_en.vtt | 8.91 KB | ||
| 005 Birthday Paradox.mp4 | 27.71 MB | ||
| 005 Birthday Paradox_en.vtt | 9.69 KB | ||
| 005 birthday-paradox.cpp | 408 B | ||
| 006 Birthday Paradox Code.mp4 | 35.32 MB | ||
| 006 Birthday Paradox Code_en.vtt | 8.34 KB | ||
| 006 birthday-paradox.cpp | 408 B | ||
| 007 Catalan Numbers.mp4 | 16.46 MB | ||
| 007 Catalan Numbers_en.vtt | 9.46 KB | ||
| 008 Catalan Numbers Code - Recursive.mp4 | 8.36 MB | ||
| 008 Catalan Numbers Code - Recursive_en.vtt | 3.01 KB | ||
| 009 Catalan Numbers Code - Iterative DP.mp4 | 13.5 MB | ||
| 009 Catalan Numbers Code - Iterative DP_en.vtt | 4.14 KB | ||
| 010 OEIS.html | 403 B | ||
| 011 Introduction to Algorithms.html | 60 B | ||
| 16 - Recursion | |||
| 001 Recursion Basics.mp4 | 33.13 MB | ||
| 001 Recursion Basics_en.vtt | 13.62 KB | ||
| 002 Factorial.mp4 | 21.29 MB | ||
| 002 Factorial_en.vtt | 9.32 KB | ||
| 002 factorial.cpp | 205 B | ||
| 003 Fibonacci Series.mp4 | 30.32 MB | ||
| 003 Fibonacci Series_en.vtt | 14.02 KB | ||
| 003 fibonacci.cpp | 205 B | ||
| 004 Sorted Array Check.mp4 | 32.46 MB | ||
| 004 Sorted Array Check_en.vtt | 11.91 KB | ||
| 004 sorted-array.cpp | 502 B | ||
| 005 Understanding Recursion DIrections.mp4 | 18.83 MB | ||
| 005 Understanding Recursion DIrections_en.vtt | 9.39 KB | ||
| 006 Power Function.mp4 | 12.89 MB | ||
| 006 Power Function_en.vtt | 4.07 KB | ||
| 006 power.cpp | 419 B | ||
| 007 Fast Power.mp4 | 12.89 MB | ||
| 007 Fast Power_en.vtt | 5.31 KB | ||
| 007 fast-exponentiation.cpp | 306 B | ||
| 008 Tiling Problem.mp4 | 15.31 MB | ||
| 008 Tiling Problem_en.vtt | 8.19 KB | ||
| 009 Count Strings.mp4 | 16.6 MB | ||
| 009 Count Strings_en.vtt | 8.49 KB | ||
| 010 Friend's Pairing Problem.mp4 | 15.47 MB | ||
| 010 Friend's Pairing Problem_en.vtt | 7.28 KB | ||
| 011 Tower Of Hanoi.mp4 | 99.02 MB | ||
| 011 Tower Of Hanoi_en.vtt | 26.18 KB | ||
| 012 Tower Of Hanoi (code).mp4 | 63.04 MB | ||
| 012 Tower Of Hanoi (code)_en.vtt | 11.11 KB | ||
| 012 tower-of-hanoi.cpp | 511 B | ||
| 17 - Backtracking | |||
| 001 Backtracking Problems.mp4 | 9.71 MB | ||
| 001 Backtracking Problems_en.vtt | 5.08 KB | ||
| 002 Finding Subsets.mp4 | 31.22 MB | ||
| 002 Finding Subsets_en.vtt | 15.67 KB | ||
| 003 Finding Subsets Code.mp4 | 19.64 MB | ||
| 003 Finding Subsets Code_en.vtt | 7.9 KB | ||
| 003 subsets.cpp | 497 B | ||
| 004 Permuations.mp4 | 23.6 MB | ||
| 004 Permuations_en.vtt | 11.17 KB | ||
| 005 Brackets.mp4 | 15.57 MB | ||
| 005 Brackets_en.vtt | 8.75 KB | ||
| 006 Brackets Code.mp4 | 24.33 MB | ||
| 006 Brackets Code_en.vtt | 7.54 KB | ||
| 006 generate-brackets.cpp | 440 B | ||
| 007 N-Queen.mp4 | 26.32 MB | ||
| 007 N-Queen_en.vtt | 14.57 KB | ||
| 008 N-Queen Code.mp4 | 37.72 MB | ||
| 008 N-Queen Code_en.vtt | 17.43 KB | ||
| 008 n-queen-print-one.cpp | 1.4 KB | ||
| 009 N-Queen Ways.mp4 | 38.69 MB | ||
| 009 N-Queen Ways_en.vtt | 18.17 KB | ||
| 009 n-queen-all-ways.cpp | 1.35 KB | ||
| 010 Sudoku Solver.mp4 | 27.93 MB | ||
| 010 Sudoku Solver_en.vtt | 13.18 KB | ||
| 011 Sudoku Solver Code.mp4 | 52.88 MB | ||
| 011 Sudoku Solver Code_en.vtt | 19.07 KB | ||
| 011 Sudoku.cpp | 1.49 KB | ||
| 18 - Binary Search | |||
| 001 Binary Search.mp4 | 21.8 MB | ||
| 001 Binary Search_en.vtt | 9.56 KB | ||
| 002 Binary Search Code.mp4 | 6.66 MB | ||
| 002 Binary Search Code_en.vtt | 4.2 KB | ||
| 002 binary-search.cpp | 602 B | ||
| 003 Lower Bound and Upper Bound.mp4 | 16.48 MB | ||
| 003 Lower Bound and Upper Bound_en.vtt | 8.69 KB | ||
| 004 Lower Bound Code.mp4 | 7.61 MB | ||
| 004 Lower Bound Code_en.vtt | 3.26 KB | ||
| 005 Angry Birds.mp4 | 28.45 MB | ||
| 005 Angry Birds_en.vtt | 13.63 KB | ||
| 006 04-angry-birds.cpp | 799 B | ||
| 006 Angry Bird Code.mp4 | 29.85 MB | ||
| 006 Angry Bird Code_en.vtt | 10.42 KB | ||
| 007 Game of Greed.mp4 | 20.37 MB | ||
| 007 Game of Greed_en.vtt | 10.11 KB | ||
| 008 Game of Greed Code.mp4 | 21.53 MB | ||
| 008 Game of Greed Code_en.vtt | 11.63 KB | ||
| 19 - Divide & Conquer | |||
| 001 Merge Sort.mp4 | 9.92 MB | ||
| 001 Merge Sort_en.vtt | 4.83 KB | ||
| 002 01-mergesort-vector.cpp | 1.01 KB | ||
| 002 Merge Sort Code.mp4 | 39.99 MB | ||
| 002 Merge Sort Code_en.vtt | 13.51 KB | ||
| 003 Quick Sort.mp4 | 25.56 MB | ||
| 003 Quick Sort_en.vtt | 12.74 KB | ||
| 004 03-quicksort.cpp | 625 B | ||
| 004 Quick Sort Code.mp4 | 25.55 MB | ||
| 004 Quick Sort Code_en.vtt | 12.74 KB | ||
| 005 Quick Select.mp4 | 10.2 MB | ||
| 005 Quick Select_en.vtt | 5.38 KB | ||
| 006 04-quickselect.cpp | 699 B | ||
| 006 Quick Select Code.mp4 | 13.4 MB | ||
| 006 Quick Select Code_en.vtt | 3.34 KB | ||
| 007 Inversion Count.mp4 | 28.93 MB | ||
| 007 Inversion Count_en.vtt | 16.53 KB | ||
| 008 02-inversion-count.cpp | 1.09 KB | ||
| 008 Inversion Count Code.mp4 | 13.21 MB | ||
| 008 Inversion Count Code_en.vtt | 4.6 KB | ||
| 009 Ternary Search.mp4 | 150.5 MB | ||
| 009 Ternary Search_en.vtt | 18.21 KB | ||
| 010 Ternary Search - Finding maximaminima of a parabola (Code).mp4 | 46.49 MB | ||
| 010 Ternary Search - Finding maximaminima of a parabola (Code)_en.vtt | 7.52 KB | ||
| 010 ternary-search.cpp | 536 B | ||
| 20 - Greedy Algorithms | |||
| 001 Greedy Introduction.mp4 | 14.93 MB | ||
| 001 Greedy Introduction_en.vtt | 5.73 KB | ||
| 002 Indian Coin Change.mp4 | 50.71 MB | ||
| 002 Indian Coin Change_en.vtt | 5.53 KB | ||
| 003 Greedy vs DP.mp4 | 13.24 MB | ||
| 003 Greedy vs DP_en.vtt | 6.75 KB | ||
| 004 Activity Selection Busyman.mp4 | 70.52 MB | ||
| 004 Activity Selection Busyman_en.vtt | 11.51 KB | ||
| 005 Baised Standings.mp4 | 47.38 MB | ||
| 005 Baised Standings_en.vtt | 8.11 KB | ||
| 006 Kingdom Defense.mp4 | 162.74 MB | ||
| 006 Kingdom Defense_en.vtt | 15.2 KB | ||
| 21 - Meet In The Middle | |||
| 001 Introduction.mp4 | 193.99 MB | ||
| 001 Introduction_en.vtt | 25.58 KB | ||
| 002 Subsums Code.mp4 | 45.35 MB | ||
| 002 Subsums Code_en.vtt | 6.6 KB | ||
| 002 subsums-spoj.cpp | 1.07 KB | ||
| 22 - Segment Trees | |||
| 001 Introduction to Range Queries.html | 58 B | ||
| 002 Introduction and Structure.mp4 | 31.67 MB | ||
| 002 Introduction and Structure_en.vtt | 12.92 KB | ||
| 003 Building.mp4 | 41.7 MB | ||
| 003 Building_en.vtt | 6.48 KB | ||
| 004 Query.mp4 | 60.06 MB | ||
| 004 Query_en.vtt | 22.31 KB | ||
| 005 Update.mp4 | 70.91 MB | ||
| 005 Update_en.vtt | 10.59 KB | ||
| 006 Facts and Properties.mp4 | 81.32 MB | ||
| 006 Facts and Properties_en.vtt | 11.93 KB | ||
| 007 Code.mp4 | 236.5 MB | ||
| 007 Code_en.vtt | 31.01 KB | ||
| 007 segment-tree.cpp | 1.91 KB | ||
| 23 - Lazy Propagation | |||
| 001 Introduction.mp4 | 43.94 MB | ||
| 001 Introduction_en.vtt | 13.8 KB | ||
| 002 Algorithm.mp4 | 157.31 MB | ||
| 002 Algorithm_en.vtt | 18.55 KB | ||
| 003 Code.mp4 | 166.64 MB | ||
| 003 Code_en.vtt | 15.06 KB | ||
| 004 Bug and Code Continued.mp4 | 13.47 MB | ||
| 004 Bug and Code Continued_en.vtt | 4.19 KB | ||
| 004 segment-tree-with-lazy-propagation.cpp | 2.73 KB | ||
| 24 - Fenwick Trees | |||
| 001 Structure.mp4 | 126.97 MB | ||
| 001 Structure_en.vtt | 13.86 KB | ||
| 002 Query.mp4 | 64.79 MB | ||
| 002 Query_en.vtt | 16.03 KB | ||
| 003 Update.mp4 | 119.57 MB | ||
| 003 Update_en.vtt | 12.38 KB | ||
| 004 Code.mp4 | 132.38 MB | ||
| 004 Code_en.vtt | 13.85 KB | ||
| 004 fenwick-tree.cpp | 905 B | ||
| 005 Inversion Count (Multiple Ways of solving it).mp4 | 23.88 MB | ||
| 005 Inversion Count (Multiple Ways of solving it)_en.vtt | 8.76 KB | ||
| 006 Inversion Count Using Fenwick Tree.mp4 | 32.34 MB | ||
| 006 Inversion Count Using Fenwick Tree_en.vtt | 13.95 KB | ||
| 007 Inversion Count Using Fenwick Tree Code.mp4 | 59.94 MB | ||
| 007 Inversion Count Using Fenwick Tree Code_en.vtt | 6.14 KB | ||
| 007 inversion-count-using-fenwick-tree.cpp | 1018 B | ||
| 25 - Sqrt Decomposition | |||
| 001 Sqrt Decomposition Introduction.mp4 | 87.75 MB | ||
| 001 Sqrt Decomposition Introduction_en.vtt | 14.38 KB | ||
| 002 Range queries (Code).mp4 | 87.85 MB | ||
| 002 Range queries (Code)_en.vtt | 11.04 KB | ||
| 002 sqrt-deecomposition.cpp | 608 B | ||
| 003 DQUERY SPOJ using Mo's Algorithm.mp4 | 130.72 MB | ||
| 003 DQUERY SPOJ using Mo's Algorithm_en.vtt | 13.94 KB | ||
| 004 Sorting the queries according to MO's comparator.mp4 | 26.17 MB | ||
| 004 Sorting the queries according to MO's comparator_en.vtt | 12.02 KB | ||
| 004 sorting-based-on-mos.cpp | 712 B | ||
| 005 4 Pointers Technique.mp4 | 116 MB | ||
| 005 4 Pointers Technique_en.vtt | 19.75 KB | ||
| 006 Code and Complexity of MO's Algorithm.mp4 | 230.29 MB | ||
| 006 Code and Complexity of MO's Algorithm_en.vtt | 23.53 KB | ||
| 006 dquery-spoj.cpp | 1.4 KB | ||
| 007 DQUERY using Fenwick Tree.mp4 | 117.41 MB | ||
| 007 DQUERY using Fenwick Tree_en.vtt | 21.66 KB | ||
| 26 - Combinatorial Games | |||
| 001 Game Theory Introduction.html | 94 B | ||
| 002 Combinatorial Games.mp4 | 61.45 MB | ||
| 002 Combinatorial Games_en.vtt | 9.63 KB | ||
| 003 Take Away Games.mp4 | 59.81 MB | ||
| 003 Take Away Games_en.vtt | 19.32 KB | ||
| 004 N and P positions.mp4 | 119.27 MB | ||
| 004 N and P positions_en.vtt | 8.99 KB | ||
| 27 - The Game Of NIM | |||
| 001 Game of Nim.mp4 | 76.52 MB | ||
| 001 Game of Nim_en.vtt | 11.09 KB | ||
| 002 Nim Sum.mp4 | 16.31 MB | ||
| 002 Nim Sum_en.vtt | 6.46 KB | ||
| 003 Applications of Nim Sum.mp4 | 208.6 MB | ||
| 003 Applications of Nim Sum_en.vtt | 27.92 KB | ||
| 004 Examples of Nim Games.mp4 | 192.69 MB | ||
| 004 Examples of Nim Games_en.vtt | 18.63 KB | ||
| 28 - Graph Traversals | |||
| 001 Graphs Introduction.html | 56 B | ||
| 002 Introduction.mp4 | 30.71 MB | ||
| 002 Introduction_en.vtt | 14.85 KB | ||
| 003 Graph Key Concepts.mp4 | 20.06 MB | ||
| 003 Graph Key Concepts_en.vtt | 10.98 KB | ||
| 004 01-adj-list.cpp | 664 B | ||
| 004 Adjacency List.mp4 | 16.55 MB | ||
| 004 Adjacency List_en.vtt | 9.18 KB | ||
| 005 02-adj-list-node.cpp | 1003 B | ||
| 005 Adjacency List.mp4 | 27 MB | ||
| 005 Adjacency List_en.vtt | 9.24 KB | ||
| 006 BFS Concept.mp4 | 15.38 MB | ||
| 006 BFS Concept_en.vtt | 7.88 KB | ||
| 007 03-bfs.cpp | 894 B | ||
| 007 BFS.mp4 | 66.03 MB | ||
| 007 BFS_en.vtt | 7.68 KB | ||
| 008 DFS.mp4 | 9.56 MB | ||
| 008 DFS_en.vtt | 4.85 KB | ||
| 009 04-dfs.cpp | 792 B | ||
| 009 DFS Code.mp4 | 13.65 MB | ||
| 009 DFS Code_en.vtt | 6.01 KB | ||
| 010 Shortest Path.mp4 | 9.71 MB | ||
| 010 Shortest Path_en.vtt | 5.35 KB | ||
| 011 03-bfs-shortest-path.cpp | 1.4 KB | ||
| 011 Shortest Path Code.mp4 | 18.48 MB | ||
| 011 Shortest Path Code_en.vtt | 5.95 KB | ||
| 012 Board Game.mp4 | 29.73 MB | ||
| 012 Board Game_en.vtt | 14.14 KB | ||
| 013 Board Game Code.mp4 | 60.41 MB | ||
| 013 Board Game Code_en.vtt | 19.5 KB | ||
| 013 board-game.cpp | 2.24 KB | ||
| 29 - Graphs as Trees | |||
| 001 Trees.mp4 | 237.82 MB | ||
| 001 Trees_en.vtt | 27.18 KB | ||
| 002 DFS on Trees.mp4 | 30.45 MB | ||
| 002 DFS on Trees_en.vtt | 9.21 KB | ||
| 002 ancestor-printing.cpp | 587 B | ||
| 003 DFS Trees and Backedges.mp4 | 30.69 MB | ||
| 003 DFS Trees and Backedges_en.vtt | 11.06 KB | ||
| 004 DFS Tree and Backedges Code.mp4 | 103.57 MB | ||
| 004 DFS Tree and Backedges Code_en.vtt | 20.39 KB | ||
| 004 DFS-tree-and-backedge-code.cpp | 668 B | ||
| 30 - Lowest Common Ancestors | |||
| 001 LCA introduction.mp4 | 99.55 MB | ||
| 001 LCA introduction_en.vtt | 15.08 KB | ||
| 002 LCA Brute Force.mp4 | 77.13 MB | ||
| 002 LCA Brute Force_en.vtt | 17.63 KB | ||
| 002 LCA-using-2-pointers.cpp | 985 B | ||
| 003 LCA using Binary Lifting.mp4 | 397.14 MB | ||
| 003 LCA using Binary Lifting_en.vtt | 44.82 KB | ||
| 003 LCA-using-sparse-table.cpp | 1.5 KB | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| 31 - Directed Graphs & SCC's | |||
| 001 Intro.mp4 | 110.86 MB | ||
| 001 Intro_en.vtt | 22.21 KB | ||
| 002 Topological Sort.mp4 | 118.93 MB | ||
| 002 Topological Sort_en.vtt | 23.3 KB | ||
| 002 topological-Order.cpp | 672 B | ||
| 003 SCC Theory.mp4 | 59.14 MB | ||
| 003 SCC Theory_en.vtt | 11.94 KB | ||
| 004 Condensed Component Graph.mp4 | 36.91 MB | ||
| 004 Condensed Component Graph_en.vtt | 15.14 KB | ||
| 005 Kosaraju Algorithm Code.mp4 | 91.23 MB | ||
| 005 Kosaraju Algorithm Code_en.vtt | 11.99 KB | ||
| 005 kosaraju-algorithm-for-SCC.cpp | 1.06 KB | ||
| 006 Kosaraju Algorithm for Strongly Connected Component.mp4 | 202.61 MB | ||
| 006 Kosaraju Algorithm for Strongly Connected Component_en.vtt | 35.55 KB | ||
| 32 - Disjoint Set Union Data Structure | |||
| 001 DSU Introduction.mp4 | 10.23 MB | ||
| 001 DSU Introduction_en.vtt | 4.86 KB | ||
| 002 DSU Data Structure.mp4 | 18.97 MB | ||
| 002 DSU Data Structure_en.vtt | 10.03 KB | ||
| 003 Union & Find Ops.mp4 | 15.03 MB | ||
| 003 Union & Find Ops_en.vtt | 7.66 KB | ||
| 004 DSU Implementation.mp4 | 31.97 MB | ||
| 004 DSU Implementation_en.vtt | 12.76 KB | ||
| 004 dsu-1.cpp | 1.17 KB | ||
| 004 dsu-2.cpp | 1.53 KB | ||
| 005 Union By Rank.mp4 | 30.66 MB | ||
| 005 Union By Rank_en.vtt | 9.71 KB | ||
| 006 Path Compression.mp4 | 22.53 MB | ||
| 006 Path Compression_en.vtt | 9.21 KB | ||
| 006 dsu-rank-path-compression.cpp | 1.63 KB | ||
| 33 - Spanning Trees | |||
| 001 Dry Run.mp4 | 35.24 MB | ||
| 001 Dry Run_en.vtt | 13.4 KB | ||
| 002 Prim's Algorithm.mp4 | 35.53 MB | ||
| 002 Prim's Algorithm_en.vtt | 20.85 KB | ||
| 003 Prim's Code.mp4 | 57.45 MB | ||
| 003 Prim's Code_en.vtt | 18.7 KB | ||
| 003 prims-code.cpp | 1.22 KB | ||
| 004 Kruskal's Algorithm.mp4 | 18.24 MB | ||
| 004 Kruskal's Algorithm_en.vtt | 9.89 KB | ||
| 005 Kruskal's Code.mp4 | 29.67 MB | ||
| 005 Kruskal's Code_en.vtt | 13.25 KB | ||
| 005 kruskal-code.cpp | 1.63 KB | ||
| 34 - Shortest Paths Algorithms | |||
| 001 Shortest Path Introduction.mp4 | 18.92 MB | ||
| 001 Shortest Path Introduction_en.vtt | 10.04 KB | ||
| 002 Dijkstra's Algorithm.mp4 | 96.21 MB | ||
| 002 Dijkstra's Algorithm_en.vtt | 11.04 KB | ||
| 003 Dijkstra's Algorithm Code.mp4 | 117.05 MB | ||
| 003 Dijkstra's Algorithm Code_en.vtt | 16.01 KB | ||
| 003 dijkstra.cpp | 1.42 KB | ||
| 004 Bellman Ford Algorithm.mp4 | 62.4 MB | ||
| 004 Bellman Ford Algorithm_en.vtt | 35.33 KB | ||
| 005 Bellman Ford Code.mp4 | 16.14 MB | ||
| 005 Bellman Ford Code_en.vtt | 8.76 KB | ||
| 005 bellman-ford.cpp | 1.02 KB | ||
| 006 Floyd Warshall Algorithm.mp4 | 75.01 MB | ||
| 006 Floyd Warshall Algorithm_en.vtt | 33.51 KB | ||
| 007 Floyd Warshall Code.mp4 | 25.6 MB | ||
| 007 Floyd Warshall Code_en.vtt | 8.06 KB | ||
| 007 floyd-warshall.cpp | 936 B | ||
| 35 - Classical Dynamic Programming | |||
| 001 Introduction to Dynamic Programming.mp4 | 43.04 MB | ||
| 001 Introduction to Dynamic Programming_en.vtt | 19.28 KB | ||
| 002 A Note About DP.mp4 | 14.3 MB | ||
| 002 A Note About DP_en.vtt | 5.94 KB | ||
| 003 N-K Ladders.mp4 | 48 MB | ||
| 003 N-K Ladders_en.vtt | 13.51 KB | ||
| 004 N-K Ladders Top Down.mp4 | 9.89 MB | ||
| 004 N-K Ladders Top Down_en.vtt | 4.18 KB | ||
| 005 N-K Ladders Bottom Up.mp4 | 36.3 MB | ||
| 005 N-K Ladders Bottom Up_en.vtt | 8.29 KB | ||
| 006 Minimum Jums.mp4 | 18.55 MB | ||
| 006 Minimum Jums_en.vtt | 7.56 KB | ||
| 007 Minimum Jumps Code.mp4 | 17.04 MB | ||
| 007 Minimum Jumps Code_en.vtt | 6.17 KB | ||
| 008 Longest Increasing Subsequence.mp4 | 11.75 MB | ||
| 008 Longest Increasing Subsequence_en.vtt | 7.32 KB | ||
| 009 Longest Increasing Subsequence Code.mp4 | 6.32 MB | ||
| 009 Longest Increasing Subsequence Code_en.vtt | 3.01 KB | ||
| 010 Box Stacking Problem.mp4 | 20.19 MB | ||
| 010 Box Stacking Problem_en.vtt | 11.97 KB | ||
| 011 Box Stacking Code.mp4 | 34.52 MB | ||
| 011 Box Stacking Code_en.vtt | 9.7 KB | ||
| 36 - Advance Dynamic Programming Problems | |||
| 001 Terms and Definitions.mp4 | 58.72 MB | ||
| 001 Terms and Definitions_en.vtt | 18.49 KB | ||
| 002 Tabulation vs Memoisation.mp4 | 48.04 MB | ||
| 002 Tabulation vs Memoisation_en.vtt | 13.94 KB | ||
| 003 Frog-1-tabulation.cpp | 557 B | ||
| 003 Frog1-recursive.cpp | 640 B | ||
| 003 Frogs - 1.mp4 | 174.31 MB | ||
| 003 Frogs - 1_en.vtt | 28.31 KB | ||
| 004 Frog-2-tracing.cpp | 892 B | ||
| 004 Frogs - 2.mp4 | 252.09 MB | ||
| 004 Frogs - 2_en.vtt | 29.14 KB | ||
| 005 Vacation.mp4 | 145.08 MB | ||
| 005 Vacation_en.vtt | 23.57 KB | ||
| 005 vacation.cpp | 728 B | ||
| 006 Knapsack 1.mp4 | 178.66 MB | ||
| 006 Knapsack 1_en.vtt | 28.71 KB | ||
| 006 knapsack-1.cpp | 856 B | ||
| 007 Knapsack 2.mp4 | 456.88 MB | ||
| 007 Knapsack 2_en.vtt | 44.91 KB | ||
| 007 knapsack-2.cpp | 1.03 KB | ||
| 008 LCS.mp4 | 98.93 MB | ||
| 008 LCS_en.vtt | 30.1 KB | ||
| 009 LCS (code).mp4 | 199.97 MB | ||
| 009 LCS (code)_en.vtt | 24.3 KB | ||
| 009 LCS.cpp | 938 B | ||
| 010 Longest Path.mp4 | 87.24 MB | ||
| 010 Longest Path_en.vtt | 10.63 KB | ||
| 011 Longest Path (code).mp4 | 33.92 MB | ||
| 011 Longest Path (code)_en.vtt | 8.57 KB | ||
| 011 Longest-Path.cpp | 706 B | ||
| 012 Grid 1.mp4 | 83.72 MB | ||
| 012 Grid 1_en.vtt | 10.27 KB | ||
| 013 Grid 1 (code).mp4 | 17.24 MB | ||
| 013 Grid 1 (code)_en.vtt | 3.87 KB | ||
| 013 Grid-1.cpp | 730 B | ||
| 014 Coins.mp4 | 33.62 MB | ||
| 014 Coins_en.vtt | 8.14 KB | ||
| 015 Coins (code).mp4 | 85.53 MB | ||
| 015 Coins (code)_en.vtt | 13.81 KB | ||
| 015 Coins.cpp | 872 B | ||
| 016 Sushi.mp4 | 103.37 MB | ||
| 016 Sushi_en.vtt | 16.41 KB | ||
| 017 Sushi (code).mp4 | 121.74 MB | ||
| 017 Sushi (code)_en.vtt | 12.33 KB | ||
| 017 sushi.cpp | 1.11 KB | ||
| 018 Stones.mp4 | 130.94 MB | ||
| 018 Stones_en.vtt | 14.93 KB | ||
| 019 Deque (first solution).mp4 | 230.95 MB | ||
| 019 Deque (first solution)_en.vtt | 35.16 KB | ||
| 019 deque-1.cpp | 993 B | ||
| 020 Deque (second solution).mp4 | 105.73 MB | ||
| 020 Deque (second solution)_en.vtt | 11.88 KB | ||
| 020 deque-2.cpp | 659 B | ||
| 021 Candies.mp4 | 274.88 MB | ||
| 021 Candies_en.vtt | 32.33 KB | ||
| 022 Candies (code).mp4 | 76.98 MB | ||
| 022 Candies (code)_en.vtt | 11.35 KB | ||
| 022 candies.cpp | 1.05 KB | ||
| 023 Slimes.mp4 | 51.59 MB | ||
| 023 Slimes_en.vtt | 15.53 KB | ||
| 024 Slimes (code).mp4 | 131.67 MB | ||
| 024 Slimes (code)_en.vtt | 18.97 KB | ||
| 024 slimes.cpp | 750 B | ||
| 025 Matching.mp4 | 75.66 MB | ||
| 025 Matching_en.vtt | 10.08 KB | ||
| 026 Matching continued.mp4 | 36.16 MB | ||
| 026 Matching continued_en.vtt | 6.83 KB | ||
| 027 Matching (code).mp4 | 142.49 MB | ||
| 027 Matching (code)_en.vtt | 22.73 KB | ||
| 028 Independent Set.mp4 | 90.28 MB | ||
| 028 Independent Set_en.vtt | 27.41 KB | ||
| 029 Independent Set (code).mp4 | 40.95 MB | ||
| 029 Independent Set (code)_en.vtt | 10.11 KB | ||
| 029 independet-set.cpp | 868 B | ||
| 030 Flowers.mp4 | 201.12 MB | ||
| 030 Flowers_en.vtt | 22.12 KB | ||
| 031 Flowers using segment tree.mp4 | 24.35 MB | ||
| 031 Flowers using segment tree_en.vtt | 6.98 KB | ||
| 032 Flowers (code).mp4 | 230.82 MB | ||
| 032 Flowers (code)_en.vtt | 23.05 KB | ||
| 032 flowers.cpp | 1.87 KB | ||
| 033 Walk.mp4 | 201.8 MB | ||
| 033 Walk_en.vtt | 18.98 KB | ||
| 034 Walk (code).mp4 | 69.3 MB | ||
| 034 Walk (code)_en.vtt | 6.12 KB | ||
| 034 walk.cpp | 1 KB | ||
| 035 Digit Sum.mp4 | 134.21 MB | ||
| 035 Digit Sum_en.vtt | 20.87 KB | ||
| 036 Digit Sum (code).mp4 | 173.15 MB | ||
| 036 Digit Sum (code)_en.vtt | 20.94 KB | ||
| 036 digit-sum.cpp | 776 B | ||
| 037 Permutation.mp4 | 196.18 MB | ||
| 037 Permutation_en.vtt | 32.82 KB | ||
| 038 Permutation (Brute Force).mp4 | 78.02 MB | ||
| 038 Permutation (Brute Force)_en.vtt | 21.16 KB | ||
| 039 Permutation (code).mp4 | 133.01 MB | ||
| 039 Permutation (code)_en.vtt | 21.61 KB | ||
| 039 permutation.cpp | 1.36 KB | ||
| 37 - Pattern String Matching | |||
| 001 Introduction to Advanced Module!.html | 67 B | ||
| 002 Brute Force Pattern Matching using STL.mp4 | 51.66 MB | ||
| 002 Brute Force Pattern Matching using STL_en.vtt | 11.87 KB | ||
| 003 Trie.cpp | 1004 B | ||
| 003 Trie.mp4 | 228.55 MB | ||
| 003 Trie_en.vtt | 34.99 KB | ||
| 004 Pattern Matching using Trie.mp4 | 62.75 MB | ||
| 004 Pattern Matching using Trie_en.vtt | 14.4 KB | ||
| 004 trie-pattern-matching.cpp | 993 B | ||
| 005 String Hashing - Polynomial Hash Function.mp4 | 147.42 MB | ||
| 005 String Hashing - Polynomial Hash Function_en.vtt | 16.33 KB | ||
| 006 Polynomial Hash Code.mp4 | 45.03 MB | ||
| 006 Polynomial Hash Code_en.vtt | 5.44 KB | ||
| 007 Rolling Hash Rabin Karp Algorithm.mp4 | 28.16 MB | ||
| 007 Rolling Hash Rabin Karp Algorithm_en.vtt | 11.14 KB | ||
| 008 Rabin Karp algorithm Code.mp4 | 161.18 MB | ||
| 008 Rabin Karp algorithm Code_en.vtt | 12.85 KB | ||
| 008 rabin-carp.cpp | 1.23 KB | ||
| 38 - Geometric Algorithms - Convex Hull | |||
| 001 Introduction.mp4 | 20.68 MB | ||
| 001 Introduction_en.vtt | 8.66 KB | ||
| 002 Orientation of Points.mp4 | 25.76 MB | ||
| 002 Orientation of Points_en.vtt | 8.18 KB | ||
| 003 Graham's Scan algorithm.mp4 | 155.3 MB | ||
| 003 Graham's Scan algorithm_en.vtt | 25.95 KB | ||
| 004 Graham's Scan Algorithm Code.mp4 | 255.5 MB | ||
| 004 Graham's Scan Algorithm Code_en.vtt | 26.41 KB | ||
| 004 graham-scan-convex-hull.cpp | 1.92 KB | ||
| 005 Problem - Polygon (Codeforces).mp4 | 84.45 MB | ||
| 005 Problem - Polygon (Codeforces)_en.vtt | 8.58 KB | ||
| 005 convex-hull-include-collinear-points.cpp | 1.92 KB | ||
| 39 - Interactive Problems | |||
| 001 Introduction.mp4 | 108.16 MB | ||
| 001 Introduction_en.vtt | 23.51 KB | ||
| 002 Codeforces - Guess the Number.mp4 | 137.2 MB | ||
| 002 Codeforces - Guess the Number_en.vtt | 16.23 KB | ||
| 003 Guess the Number - code.mp4 | 62.3 MB | ||
| 003 Guess the Number - code_en.vtt | 7.75 KB | ||
| 003 guess-the-number | 58.93 KB | ||
| 004 Lost Numbers.mp4 | 132.51 MB | ||
| 004 Lost Numbers_en.vtt | 12.62 KB | ||
| 005 Lost Numbers (code).mp4 | 85.43 MB | ||
| 005 Lost Numbers (code)_en.vtt | 9.03 KB | ||
| 005 lost-numbers.cpp | 748 B | ||
| 006 Xor Guessing.mp4 | 102.6 MB | ||
| 006 Xor Guessing_en.vtt | 10.83 KB | ||
| 007 Xor Guessing (code).mp4 | 54.6 MB | ||
| 007 Xor Guessing (code)_en.vtt | 5.07 KB | ||
| 007 Xor-guessing.cpp | 683 B | ||
| 40 - Random Randomisation | |||
| 001 Randomised Random Function.mp4 | 40.31 MB | ||
| 001 Randomised Random Function_en.vtt | 12.11 KB | ||
| 002 Run Code for a Particular Time.mp4 | 39.06 MB | ||
| 002 Run Code for a Particular Time_en.vtt | 9.63 KB | ||
| 002 random-and-time.cpp | 478 B | ||
| 41 - Policy Based Data Structures | |||
| 001 Introduction & Applications.mp4 | 66.21 MB | ||
| 001 Introduction & Applications_en.vtt | 9.67 KB | ||
| 002 Structure and Working.mp4 | 109.09 MB | ||
| 002 Structure and Working_en.vtt | 15.16 KB | ||
| 003 Policy-based-ds.cpp | 507 B | ||
| 003 Using Coding Minutes IDE.mp4 | 85.55 MB | ||
| 003 Using Coding Minutes IDE_en.vtt | 8.63 KB | ||
| 004 Inversion Count using PBDS.mp4 | 57.13 MB | ||
| 004 Inversion Count using PBDS_en.vtt | 16.26 KB | ||
| 004 inversion-count-using-PBDS.cpp | 507 B | ||
| 42 - CP Guidance | |||
| 001 Getting started with Codeforces Spoj.mp4 | 160.31 MB | ||
| 001 Getting started with Codeforces Spoj_en.vtt | 17.48 KB | ||
| 002 Where to practice.mp4 | 63.82 MB | ||
| 002 Where to practice_en.vtt | 9.22 KB | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| ▲ 791 total files | |||
Competitive Programming Essentials, Master Algorithms 2022
Master competitive coding techniques - maths, number theory, dynamic programming, advanced data structures & algorithms
Udemy Link - https://www.udemy.com/course/competitive-programming-algorithms-coding-minutes/
Please seed as much as you can!
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 19 GB | fcs0310 | 3 years | 0 | 1 | |
| 8.77 GB | cybil18 | 4 years | 3 | 0 | |
| 661 MB | freecoursewb | 4 years | 0 | 0 | |
| 9.9 GB | tutplanet | 4 years | 0 | 0 | |
| 11.18 GB | Anonymous | 4 years | 0 | 0 |
All Comments