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