种子简介

种子名称： [FreeCourseSite.com] Udemy - Competitive Programming Essentials, Master Algorithms 2022
文件类型： 视频
文件数目： 327个文件
文件大小： 18.98 GB
收录时间： 2023-5-15 12:05
已经下载： 3次
资源热度： 123
最近下载： 2024-6-1 05:50

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:7420e4c149d8a80f3f4ad1fff262e1ff56c744a4&dn=[FreeCourseSite.com] Udemy - Competitive Programming Essentials, Master Algorithms 2022 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[FreeCourseSite.com] Udemy - Competitive Programming Essentials, Master Algorithms 2022.torrent

01 - Introduction/001 Introduction.mp486.75MB

02 - Setting Up Sublime [Optional]/001 Sublime Setup.mp491.21MB

02 - Setting Up Sublime [Optional]/002 Adding Master Header File.mp432.06MB

02 - Setting Up Sublime [Optional]/003 Escaping Online Judges.mp418.3MB

02 - Setting Up Sublime [Optional]/004 Common Code Snippets.mp446.09MB

02 - Setting Up Sublime [Optional]/005 Using Macros.mp426.82MB

02 - Setting Up Sublime [Optional]/006 Example Code Explained.mp4149.83MB

03 - Time Space Complexity Analysis/001 Space Time Complexity Introduction.mp497.64MB

03 - Time Space Complexity Analysis/002 Experimental Analysis.mp442.03MB

03 - Time Space Complexity Analysis/003 Big O Notation.mp410.8MB

03 - Time Space Complexity Analysis/004 Nested Loops.mp45.98MB

03 - Time Space Complexity Analysis/005 Nested Loops - II.mp46.58MB

03 - Time Space Complexity Analysis/006 Analysis of Bubble Sort.mp49.3MB

03 - Time Space Complexity Analysis/007 Analayis of BInary Search.mp418.13MB

03 - Time Space Complexity Analysis/008 Analysis of Merge Sort.mp414.49MB

03 - Time Space Complexity Analysis/009 Avoiding TLE Errors.mp47.89MB

03 - Time Space Complexity Analysis/010 Complexities for Worst Case AC.mp47.55MB

04 - Data Structures & STL Containers/001 Data Structures & STL Containers Revisited.mp489.5MB

04 - Data Structures & STL Containers/002 Arrays in C++.mp443.17MB

04 - Data Structures & STL Containers/003 Array STL.mp451.73MB

04 - Data Structures & STL Containers/004 Vector STL.mp443.93MB

04 - Data Structures & STL Containers/005 Deque STL.mp450.27MB

04 - Data Structures & STL Containers/006 Stack STL.mp47.76MB

04 - Data Structures & STL Containers/007 Queue STL.mp44.61MB

04 - Data Structures & STL Containers/008 Priority Queue STL.mp413.71MB

05 - Bitmanipulation Basics/001 Bitwise Operators.mp421.91MB

05 - Bitmanipulation Basics/002 Left Shift & Right Shift.mp49.2MB

05 - Bitmanipulation Basics/003 Odd Even.mp47.32MB

05 - Bitmanipulation Basics/004 Get ith Bit.mp410.23MB

05 - Bitmanipulation Basics/005 Clear ith Bit.mp47.96MB

05 - Bitmanipulation Basics/006 Set ith Bit.mp410.99MB

05 - Bitmanipulation Basics/007 Update ith Bit.mp418.26MB

05 - Bitmanipulation Basics/008 Clear Last i Bits.mp411.62MB

05 - Bitmanipulation Basics/009 Clear Range of Bits.mp417.44MB

05 - Bitmanipulation Basics/010 Replace Bits.mp413.8MB

05 - Bitmanipulation Basics/011 Two Power.mp47.83MB

05 - Bitmanipulation Basics/012 Count Bits.mp414.91MB

05 - Bitmanipulation Basics/013 Count Bits Hack.mp411.38MB

05 - Bitmanipulation Basics/014 Make it Binary.mp414.27MB

06 - Bitmanipulation Problems/001 Unique Number - I.mp416.86MB

06 - Bitmanipulation Problems/002 Unique Number - I Code.mp43.32MB

06 - Bitmanipulation Problems/003 Unique Number - II.mp422.37MB

06 - Bitmanipulation Problems/004 Unique Number - II Code.mp418.74MB

06 - Bitmanipulation Problems/005 Unique Number - III.mp460.2MB

06 - Bitmanipulation Problems/006 Unique Number - III Code.mp421.48MB

06 - Bitmanipulation Problems/007 Finding Subsets.mp413.72MB

06 - Bitmanipulation Problems/008 Finding Subsets Code.mp412.42MB

06 - Bitmanipulation Problems/009 Travelling Salesman Problem.mp434.78MB

06 - Bitmanipulation Problems/010 Travelling Salesman Intution.mp411.03MB

06 - Bitmanipulation Problems/011 Travelling Salesman Code.mp439.89MB

06 - Bitmanipulation Problems/012 Travelling Salesman - DP Optimisation.mp49.32MB

07 - Big Integers/002 Introduction to Big Integers.mp410.28MB

07 - Big Integers/003 Big Addition Concept.mp419.74MB

07 - Big Integers/004 Big Addition Code.mp429.62MB

07 - Big Integers/005 Array & Integer Multiplication.mp415.81MB

07 - Big Integers/006 Large Factorials.mp424.61MB

07 - Big Integers/007 Java Big Integer Class.mp474.63MB

07 - Big Integers/008 BigInteger Example.mp47.39MB

07 - Big Integers/009 Big Integers in Python.mp411.95MB

07 - Big Integers/011 Big Integer Challenge - Julka.mp454.61MB

07 - Big Integers/012 Big Integer Challenge Solution.mp430.42MB

08 - Linear Recurrences & Matrix Exponentiation/001 Binary Exponentiation.mp4103.55MB

08 - Linear Recurrences & Matrix Exponentiation/002 Modular Binary Exponentiation.mp425.08MB

08 - Linear Recurrences & Matrix Exponentiation/003 Fast Mutiplication.mp438.32MB

08 - Linear Recurrences & Matrix Exponentiation/004 Matrix Exponentiation Introduction.mp4172.21MB

08 - Linear Recurrences & Matrix Exponentiation/005 Matrix Exponentiation Code.mp4173.47MB

08 - Linear Recurrences & Matrix Exponentiation/006 Fibosum (spoj).mp447.92MB

08 - Linear Recurrences & Matrix Exponentiation/007 Fibosum(second approach).mp475.43MB

09 - Pigeonhole Principle/001 Pigeonhole Principle.mp47.1MB

09 - Pigeonhole Principle/002 Problem DIVSUB.mp436.49MB

09 - Pigeonhole Principle/003 Applying Pigeonhole Principle.mp428.4MB

09 - Pigeonhole Principle/004 Gray Similar Code.mp443.65MB

09 - Pigeonhole Principle/005 Holiday.mp4241.12MB

09 - Pigeonhole Principle/006 Holiday Code.mp475.29MB

10 - Mathematical Expectation/001 Expectation.mp451.48MB

10 - Mathematical Expectation/002 Linearity of Expectation.mp46.87MB

10 - Mathematical Expectation/003 Problem - Linearity of Expectation.mp44.07MB

10 - Mathematical Expectation/004 Expected Throws - One Head.mp48.76MB

10 - Mathematical Expectation/005 Expected Throws - Two Consecutive Heads.mp48.74MB

10 - Mathematical Expectation/006 Expected Throws - N Consecutive Heads.mp49.96MB

10 - Mathematical Expectation/007 Bernaulli's Trial.mp48.13MB

10 - Mathematical Expectation/008 Choose Number.mp42.36MB

10 - Mathematical Expectation/009 Bernoulli's Trial.mp44.89MB

10 - Mathematical Expectation/010 Coupon Collector.mp410.6MB

11 - Inclusion Exclusion Principle/001 Inclusion Exclusion.mp436.3MB

11 - Inclusion Exclusion Principle/002 Generalised Function.mp432.95MB

11 - Inclusion Exclusion Principle/003 Problems.mp497.14MB

11 - Inclusion Exclusion Principle/004 Total Number of Divisors Till N code.mp4106.79MB

12 - Prime Numbers & Factorisation/001 Introduction.mp428.01MB

12 - Prime Numbers & Factorisation/002 Prime Sieve.mp4112.61MB

12 - Prime Numbers & Factorisation/003 Sieve of Eratosthenes Code.mp447.15MB

12 - Prime Numbers & Factorisation/004 Prime Queries.mp415.79MB

12 - Prime Numbers & Factorisation/005 Prime Factorisation.mp47.24MB

12 - Prime Numbers & Factorisation/006 Prime Factorisation Code O(N).mp45.69MB

12 - Prime Numbers & Factorisation/007 Prime Factorisation Code O(Sqrt(N)).mp415.31MB

12 - Prime Numbers & Factorisation/008 Prime Factorisation using Sieve O(LogN).mp422.66MB

12 - Prime Numbers & Factorisation/009 Segmented Sieve.mp49.84MB

12 - Prime Numbers & Factorisation/010 Segmented Sieve Algorithm.mp415.06MB

12 - Prime Numbers & Factorisation/011 Segmented Sieve Code.mp434.71MB

13 - Extended Euclidean's Algorithm & Applications/001 GCD.mp418.36MB

13 - Extended Euclidean's Algorithm & Applications/002 Euclid's Algorithm Code.mp46.31MB

13 - Extended Euclidean's Algorithm & Applications/003 GCD Complexity.mp48.43MB

13 - Extended Euclidean's Algorithm & Applications/004 Extended Euclideans.mp411.17MB

13 - Extended Euclidean's Algorithm & Applications/005 Extended Euclidean Example.mp418.68MB

13 - Extended Euclidean's Algorithm & Applications/006 Extended Euclidean Code.mp420.22MB

13 - Extended Euclidean's Algorithm & Applications/007 GCD using Extended Euclidean Algorithm.mp411.55MB

13 - Extended Euclidean's Algorithm & Applications/008 Multiplicative Modulo Inverse.mp410.01MB

13 - Extended Euclidean's Algorithm & Applications/009 Computing Multiplicative Modulo Inverse.mp48.6MB

13 - Extended Euclidean's Algorithm & Applications/010 MMI Code.mp410.15MB

13 - Extended Euclidean's Algorithm & Applications/011 Linear Diophantine Equations.mp417.47MB

13 - Extended Euclidean's Algorithm & Applications/012 Linear Diophantine Equation - Family of Solutions.mp44.27MB

14 - Theorems in Number Theory/001 Modulo Airthmetic.mp487.54MB

14 - Theorems in Number Theory/002 Modulo Arithmetic Code.mp481.55MB

14 - Theorems in Number Theory/003 Fermat's Theorem.mp466.29MB

14 - Theorems in Number Theory/004 Factorial % P.mp411.62MB

14 - Theorems in Number Theory/005 nCr % P.mp479.55MB

14 - Theorems in Number Theory/006 Chinese Remainder Theorem.mp418.49MB

14 - Theorems in Number Theory/007 Totient Function.mp418.35MB

14 - Theorems in Number Theory/008 Totient Function code using Seive.mp428.52MB

15 - Combinatorics/001 Combinatorics Introduction.mp434.74MB

15 - Combinatorics/002 Binomial Coefficients.mp422.12MB

15 - Combinatorics/004 Computing Binomial Coefficients.mp419.02MB

15 - Combinatorics/005 Birthday Paradox.mp427.71MB

15 - Combinatorics/006 Birthday Paradox Code.mp435.32MB

15 - Combinatorics/007 Catalan Numbers.mp416.46MB

15 - Combinatorics/008 Catalan Numbers Code - Recursive.mp48.36MB

15 - Combinatorics/009 Catalan Numbers Code - Iterative DP.mp413.5MB

16 - Recursion/001 Recursion Basics.mp433.13MB

16 - Recursion/002 Factorial.mp421.29MB

16 - Recursion/003 Fibonacci Series.mp430.32MB

16 - Recursion/004 Sorted Array Check.mp432.46MB

16 - Recursion/005 Understanding Recursion DIrections.mp418.83MB

16 - Recursion/006 Power Function.mp412.89MB

16 - Recursion/007 Fast Power.mp412.89MB

16 - Recursion/008 Tiling Problem.mp415.31MB

16 - Recursion/009 Count Strings.mp416.6MB

16 - Recursion/010 Friend's Pairing Problem.mp415.47MB

16 - Recursion/011 Tower Of Hanoi.mp499.02MB

16 - Recursion/012 Tower Of Hanoi (code).mp463.04MB

17 - Backtracking/001 Backtracking Problems.mp49.71MB

17 - Backtracking/002 Finding Subsets.mp431.22MB

17 - Backtracking/003 Finding Subsets Code.mp419.64MB

17 - Backtracking/004 Permuations.mp423.6MB

17 - Backtracking/005 Brackets.mp415.57MB

17 - Backtracking/006 Brackets Code.mp424.33MB

17 - Backtracking/007 N-Queen.mp426.32MB

17 - Backtracking/008 N-Queen Code.mp437.72MB

17 - Backtracking/009 N-Queen Ways.mp438.69MB

17 - Backtracking/010 Sudoku Solver.mp427.93MB

17 - Backtracking/011 Sudoku Solver Code.mp452.88MB

18 - Binary Search/001 Binary Search.mp421.8MB

18 - Binary Search/002 Binary Search Code.mp46.66MB

18 - Binary Search/003 Lower Bound and Upper Bound.mp416.48MB

18 - Binary Search/004 Lower Bound Code.mp47.61MB

18 - Binary Search/005 Angry Birds.mp428.45MB

18 - Binary Search/006 Angry Bird Code.mp429.85MB

18 - Binary Search/007 Game of Greed.mp420.37MB

18 - Binary Search/008 Game of Greed Code.mp421.53MB

19 - Divide & Conquer/001 Merge Sort.mp49.92MB

19 - Divide & Conquer/002 Merge Sort Code.mp439.99MB

19 - Divide & Conquer/003 Quick Sort.mp425.56MB

19 - Divide & Conquer/004 Quick Sort Code.mp425.55MB

19 - Divide & Conquer/005 Quick Select.mp410.2MB

19 - Divide & Conquer/006 Quick Select Code.mp413.4MB

19 - Divide & Conquer/007 Inversion Count.mp428.93MB

19 - Divide & Conquer/008 Inversion Count Code.mp413.21MB

19 - Divide & Conquer/009 Ternary Search.mp4150.5MB

19 - Divide & Conquer/010 Ternary Search - Finding maximaminima of a parabola (Code).mp446.49MB

20 - Greedy Algorithms/001 Greedy Introduction.mp414.93MB

20 - Greedy Algorithms/002 Indian Coin Change.mp450.71MB

20 - Greedy Algorithms/003 Greedy vs DP.mp413.24MB

20 - Greedy Algorithms/004 Activity Selection Busyman.mp470.52MB

20 - Greedy Algorithms/005 Baised Standings.mp447.38MB

20 - Greedy Algorithms/006 Kingdom Defense.mp4162.74MB

21 - Meet In The Middle/001 Introduction.mp4193.99MB

21 - Meet In The Middle/002 Subsums Code.mp445.35MB

22 - Segment Trees/002 Introduction and Structure.mp431.67MB

22 - Segment Trees/003 Building.mp441.7MB

22 - Segment Trees/004 Query.mp460.06MB

22 - Segment Trees/005 Update.mp470.91MB

22 - Segment Trees/006 Facts and Properties.mp481.32MB

22 - Segment Trees/007 Code.mp4236.5MB

23 - Lazy Propagation/001 Introduction.mp443.94MB

23 - Lazy Propagation/002 Algorithm.mp4157.31MB

23 - Lazy Propagation/003 Code.mp4166.64MB

23 - Lazy Propagation/004 Bug and Code Continued.mp413.47MB

24 - Fenwick Trees/001 Structure.mp4126.97MB

24 - Fenwick Trees/002 Query.mp464.79MB

24 - Fenwick Trees/003 Update.mp4119.57MB

24 - Fenwick Trees/004 Code.mp4132.38MB

24 - Fenwick Trees/005 Inversion Count (Multiple Ways of solving it).mp423.88MB

24 - Fenwick Trees/006 Inversion Count Using Fenwick Tree.mp432.34MB

24 - Fenwick Trees/007 Inversion Count Using Fenwick Tree Code.mp459.94MB

25 - Sqrt Decomposition/001 Sqrt Decomposition Introduction.mp487.75MB

25 - Sqrt Decomposition/002 Range queries (Code).mp487.85MB

25 - Sqrt Decomposition/003 DQUERY SPOJ using Mo's Algorithm.mp4130.72MB

25 - Sqrt Decomposition/004 Sorting the queries according to MO's comparator.mp426.17MB

25 - Sqrt Decomposition/005 4 Pointers Technique.mp4116MB

25 - Sqrt Decomposition/006 Code and Complexity of MO's Algorithm.mp4230.29MB

25 - Sqrt Decomposition/007 DQUERY using Fenwick Tree.mp4117.41MB

26 - Combinatorial Games/002 Combinatorial Games.mp461.45MB

26 - Combinatorial Games/003 Take Away Games.mp459.81MB

26 - Combinatorial Games/004 N and P positions.mp4119.27MB

27 - The Game Of NIM/001 Game of Nim.mp476.52MB

27 - The Game Of NIM/002 Nim Sum.mp416.31MB

27 - The Game Of NIM/003 Applications of Nim Sum.mp4208.6MB

27 - The Game Of NIM/004 Examples of Nim Games.mp4192.69MB

28 - Graph Traversals/002 Introduction.mp430.71MB

28 - Graph Traversals/003 Graph Key Concepts.mp420.06MB

28 - Graph Traversals/004 Adjacency List.mp416.55MB

28 - Graph Traversals/005 Adjacency List.mp427MB

28 - Graph Traversals/006 BFS Concept.mp415.38MB

28 - Graph Traversals/007 BFS.mp466.03MB

28 - Graph Traversals/008 DFS.mp49.56MB

28 - Graph Traversals/009 DFS Code.mp413.65MB

28 - Graph Traversals/010 Shortest Path.mp49.71MB

28 - Graph Traversals/011 Shortest Path Code.mp418.48MB

28 - Graph Traversals/012 Board Game.mp429.73MB

28 - Graph Traversals/013 Board Game Code.mp460.41MB

29 - Graphs as Trees/001 Trees.mp4237.82MB

29 - Graphs as Trees/002 DFS on Trees.mp430.45MB

29 - Graphs as Trees/003 DFS Trees and Backedges.mp430.69MB

29 - Graphs as Trees/004 DFS Tree and Backedges Code.mp4103.57MB

30 - Lowest Common Ancestors/001 LCA introduction.mp499.55MB

30 - Lowest Common Ancestors/002 LCA Brute Force.mp477.13MB

30 - Lowest Common Ancestors/003 LCA using Binary Lifting.mp4397.14MB

31 - Directed Graphs & SCC's/001 Intro.mp4110.86MB

31 - Directed Graphs & SCC's/002 Topological Sort.mp4118.93MB

31 - Directed Graphs & SCC's/003 SCC Theory.mp459.14MB

31 - Directed Graphs & SCC's/004 Condensed Component Graph.mp436.91MB

31 - Directed Graphs & SCC's/005 Kosaraju Algorithm Code.mp491.23MB

31 - Directed Graphs & SCC's/006 Kosaraju Algorithm for Strongly Connected Component.mp4202.61MB

32 - Disjoint Set Union Data Structure/001 DSU Introduction.mp410.23MB

32 - Disjoint Set Union Data Structure/002 DSU Data Structure.mp418.97MB

32 - Disjoint Set Union Data Structure/003 Union & Find Ops.mp415.03MB

32 - Disjoint Set Union Data Structure/004 DSU Implementation.mp431.97MB

32 - Disjoint Set Union Data Structure/005 Union By Rank.mp430.66MB

32 - Disjoint Set Union Data Structure/006 Path Compression.mp422.53MB

33 - Spanning Trees/001 Dry Run.mp435.24MB

33 - Spanning Trees/002 Prim's Algorithm.mp435.53MB

33 - Spanning Trees/003 Prim's Code.mp457.45MB

33 - Spanning Trees/004 Kruskal's Algorithm.mp418.24MB

33 - Spanning Trees/005 Kruskal's Code.mp429.67MB

34 - Shortest Paths Algorithms/001 Shortest Path Introduction.mp418.92MB

34 - Shortest Paths Algorithms/002 Dijkstra's Algorithm.mp496.21MB

34 - Shortest Paths Algorithms/003 Dijkstra's Algorithm Code.mp4117.05MB

34 - Shortest Paths Algorithms/004 Bellman Ford Algorithm.mp462.4MB

34 - Shortest Paths Algorithms/005 Bellman Ford Code.mp416.14MB

34 - Shortest Paths Algorithms/006 Floyd Warshall Algorithm.mp475.01MB

34 - Shortest Paths Algorithms/007 Floyd Warshall Code.mp425.6MB

35 - Classical Dynamic Programming/001 Introduction to Dynamic Programming.mp443.04MB

35 - Classical Dynamic Programming/002 A Note About DP.mp414.3MB

35 - Classical Dynamic Programming/003 N-K Ladders.mp448MB

35 - Classical Dynamic Programming/004 N-K Ladders Top Down.mp49.89MB

35 - Classical Dynamic Programming/005 N-K Ladders Bottom Up.mp436.3MB

35 - Classical Dynamic Programming/006 Minimum Jums.mp418.55MB

35 - Classical Dynamic Programming/007 Minimum Jumps Code.mp417.04MB

35 - Classical Dynamic Programming/008 Longest Increasing Subsequence.mp411.75MB

35 - Classical Dynamic Programming/009 Longest Increasing Subsequence Code.mp46.32MB

35 - Classical Dynamic Programming/010 Box Stacking Problem.mp420.19MB

35 - Classical Dynamic Programming/011 Box Stacking Code.mp434.52MB

36 - Advance Dynamic Programming Problems/001 Terms and Definitions.mp458.72MB

36 - Advance Dynamic Programming Problems/002 Tabulation vs Memoisation.mp448.04MB

36 - Advance Dynamic Programming Problems/003 Frogs - 1.mp4174.31MB

36 - Advance Dynamic Programming Problems/004 Frogs - 2.mp4252.09MB

36 - Advance Dynamic Programming Problems/005 Vacation.mp4145.08MB

36 - Advance Dynamic Programming Problems/006 Knapsack 1.mp4178.66MB

36 - Advance Dynamic Programming Problems/007 Knapsack 2.mp4456.88MB

36 - Advance Dynamic Programming Problems/008 LCS.mp498.93MB

36 - Advance Dynamic Programming Problems/009 LCS (code).mp4199.97MB

36 - Advance Dynamic Programming Problems/010 Longest Path.mp487.24MB

36 - Advance Dynamic Programming Problems/011 Longest Path (code).mp433.92MB

36 - Advance Dynamic Programming Problems/012 Grid 1.mp483.72MB

36 - Advance Dynamic Programming Problems/013 Grid 1 (code).mp417.24MB

36 - Advance Dynamic Programming Problems/014 Coins.mp433.62MB

36 - Advance Dynamic Programming Problems/015 Coins (code).mp485.53MB

36 - Advance Dynamic Programming Problems/016 Sushi.mp4103.37MB

36 - Advance Dynamic Programming Problems/017 Sushi (code).mp4121.74MB

36 - Advance Dynamic Programming Problems/018 Stones.mp4130.94MB

36 - Advance Dynamic Programming Problems/019 Deque (first solution).mp4230.95MB

36 - Advance Dynamic Programming Problems/020 Deque (second solution).mp4105.73MB

36 - Advance Dynamic Programming Problems/021 Candies.mp4274.88MB

36 - Advance Dynamic Programming Problems/022 Candies (code).mp476.98MB

36 - Advance Dynamic Programming Problems/023 Slimes.mp451.59MB

36 - Advance Dynamic Programming Problems/024 Slimes (code).mp4131.67MB

36 - Advance Dynamic Programming Problems/025 Matching.mp475.66MB

36 - Advance Dynamic Programming Problems/026 Matching continued.mp436.16MB

36 - Advance Dynamic Programming Problems/027 Matching (code).mp4142.49MB

36 - Advance Dynamic Programming Problems/028 Independent Set.mp490.28MB

36 - Advance Dynamic Programming Problems/029 Independent Set (code).mp440.95MB

36 - Advance Dynamic Programming Problems/030 Flowers.mp4201.12MB

36 - Advance Dynamic Programming Problems/031 Flowers using segment tree.mp424.35MB

36 - Advance Dynamic Programming Problems/032 Flowers (code).mp4230.82MB

36 - Advance Dynamic Programming Problems/033 Walk.mp4201.8MB

36 - Advance Dynamic Programming Problems/034 Walk (code).mp469.3MB

36 - Advance Dynamic Programming Problems/035 Digit Sum.mp4134.21MB

36 - Advance Dynamic Programming Problems/036 Digit Sum (code).mp4173.15MB

36 - Advance Dynamic Programming Problems/037 Permutation.mp4196.18MB

36 - Advance Dynamic Programming Problems/038 Permutation (Brute Force).mp478.02MB

36 - Advance Dynamic Programming Problems/039 Permutation (code).mp4133.01MB

37 - Pattern String Matching/002 Brute Force Pattern Matching using STL.mp451.66MB

37 - Pattern String Matching/003 Trie.mp4228.55MB

37 - Pattern String Matching/004 Pattern Matching using Trie.mp462.75MB

37 - Pattern String Matching/005 String Hashing - Polynomial Hash Function.mp4147.42MB

37 - Pattern String Matching/006 Polynomial Hash Code.mp445.03MB

37 - Pattern String Matching/007 Rolling Hash Rabin Karp Algorithm.mp428.16MB

37 - Pattern String Matching/008 Rabin Karp algorithm Code.mp4161.18MB

38 - Geometric Algorithms - Convex Hull/001 Introduction.mp420.68MB

38 - Geometric Algorithms - Convex Hull/002 Orientation of Points.mp425.76MB

38 - Geometric Algorithms - Convex Hull/003 Graham's Scan algorithm.mp4155.3MB

38 - Geometric Algorithms - Convex Hull/004 Graham's Scan Algorithm Code.mp4255.5MB

38 - Geometric Algorithms - Convex Hull/005 Problem - Polygon (Codeforces).mp484.45MB

39 - Interactive Problems/001 Introduction.mp4108.16MB

39 - Interactive Problems/002 Codeforces - Guess the Number.mp4137.2MB

39 - Interactive Problems/003 Guess the Number - code.mp462.3MB

39 - Interactive Problems/004 Lost Numbers.mp4132.51MB

39 - Interactive Problems/005 Lost Numbers (code).mp485.43MB

39 - Interactive Problems/006 Xor Guessing.mp4102.6MB

39 - Interactive Problems/007 Xor Guessing (code).mp454.6MB

40 - Random Randomisation/001 Randomised Random Function.mp440.31MB

40 - Random Randomisation/002 Run Code for a Particular Time.mp439.06MB

41 - Policy Based Data Structures/001 Introduction & Applications.mp466.21MB

41 - Policy Based Data Structures/002 Structure and Working.mp4109.09MB

41 - Policy Based Data Structures/003 Using Coding Minutes IDE.mp485.55MB

41 - Policy Based Data Structures/004 Inversion Count using PBDS.mp457.13MB

42 - CP Guidance/001 Getting started with Codeforces Spoj.mp4160.31MB

42 - CP Guidance/002 Where to practice.mp463.82MB