|
|
1. About the Instructor.mp4
|
MP4
|
133.3 MB
|
|
|
1. About the Instructor.srt
|
SRT
|
9.1 KB
|
|
|
1. Complete Search Introduction.mp4
|
MP4
|
34.5 MB
|
|
|
1. Complete Search Introduction.srt
|
SRT
|
2.5 KB
|
|
|
1. DP on Strings Longest Common Subsequence.mp4
|
MP4
|
127.7 MB
|
|
|
1. DP on Strings Longest Common Subsequence.srt
|
SRT
|
14 KB
|
|
|
1. Exploring Directed Graphs.mp4
|
MP4
|
161.7 MB
|
|
|
1. Exploring Directed Graphs.srt
|
SRT
|
17 KB
|
|
|
1. Graph Terminology.mp4
|
MP4
|
40.5 MB
|
|
|
1. Graph Terminology.srt
|
SRT
|
4.8 KB
|
|
|
1. Hash Functions.mp4
|
MP4
|
60.7 MB
|
|
|
1. Hash Functions.srt
|
SRT
|
9.7 KB
|
|
|
1. How To Approach Interactive Problems.mp4
|
MP4
|
102.7 MB
|
|
|
1. How To Approach Interactive Problems.srt
|
SRT
|
6.9 KB
|
|
|
1. Introduction to Section 2 and the Horse Race Problem.mp4
|
MP4
|
103.8 MB
|
|
|
1. Introduction to Section 2 and the Horse Race Problem.srt
|
SRT
|
10.8 KB
|
|
|
1. Linear Search.mp4
|
MP4
|
68.8 MB
|
|
|
1. Linear Search.srt
|
SRT
|
9.9 KB
|
|
|
1. Revisiting Sections 2 and 3.mp4
|
MP4
|
102.8 MB
|
|
|
1. Revisiting Sections 2 and 3.srt
|
SRT
|
6.9 KB
|
|
|
1. Stacks bracket matching.mp4
|
MP4
|
117.6 MB
|
|
|
1. Stacks bracket matching.srt
|
SRT
|
13.5 KB
|
|
|
1. States and Transitions.mp4
|
MP4
|
50.3 MB
|
|
|
1. States and Transitions.srt
|
SRT
|
3.2 KB
|
|
|
1. Top-Down Fibonacci.mp4
|
MP4
|
186.8 MB
|
|
|
1. Top-Down Fibonacci.srt
|
SRT
|
13.2 KB
|
|
|
1. UFDS Introduction.mp4
|
MP4
|
143.4 MB
|
|
|
1. UFDS Introduction.srt
|
SRT
|
14.5 KB
|
|
|
1. Weighted Graphs.mp4
|
MP4
|
79 MB
|
|
|
1. Weighted Graphs.srt
|
SRT
|
5.6 KB
|
|
|
1. What Makes Trees Special.mp4
|
MP4
|
38.2 MB
|
|
|
1. What Makes Trees Special.srt
|
SRT
|
2.8 KB
|
|
|
1. What are Greedy Algorithms.mp4
|
MP4
|
76.1 MB
|
|
|
1. What are Greedy Algorithms.srt
|
SRT
|
5.4 KB
|
|
|
1.1 Horses.pdf
|
PDF
|
51.4 KB
|
|
|
1.1 Problem to submit code to. Note all operations described are O(1) in C++..html
|
HTML
|
102.4 B
|
|
|
1.1 udemySection10ExploringDirectedGraphs.cpp
|
CPP
|
1.1 KB
|
|
|
1.1 udemySection14UFDSIntro.cpp
|
CPP
|
614.4 B
|
|
|
1.1 udemySection15LCS.cpp
|
CPP
|
716.8 B
|
|
|
1.1 udemySection3LinearSearch.cpp
|
CPP
|
307.2 B
|
|
|
1.1 udemySection5HashFunctions.cpp
|
CPP
|
307.2 B
|
|
|
1.1 udemySection9TopDownFibonacci.cpp
|
CPP
|
409.6 B
|
|
|
1.2 Why Choose a Prime Cardinality.html
|
HTML
|
102.4 B
|
|
|
1.2 udemySection4Stacks.cpp
|
CPP
|
1.4 KB
|
|
|
10. Bucket Sort Solution to the Football Problem.mp4
|
MP4
|
63.9 MB
|
|
|
10. Bucket Sort Solution to the Football Problem.srt
|
SRT
|
6.5 KB
|
|
|
10. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
10. Horses Problem Revisited.mp4
|
MP4
|
110.4 MB
|
|
|
10. Horses Problem Revisited.srt
|
SRT
|
10 KB
|
|
|
10. Problem Set 9.html
|
HTML
|
819.2 B
|
|
|
10.1 Hints.pdf
|
PDF
|
52 KB
|
|
|
10.1 footballers.cpp
|
CPP
|
1.7 KB
|
|
|
10.2 Solutions.pdf
|
PDF
|
113.7 KB
|
|
|
11. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
11. Horses Addendum.mp4
|
MP4
|
44.6 MB
|
|
|
11. Horses Addendum.srt
|
SRT
|
4.3 KB
|
|
|
11. Problem Set 1.html
|
HTML
|
1 KB
|
|
|
11.1 Hints.pdf
|
PDF
|
72.7 KB
|
|
|
11.2 Solutions.pdf
|
PDF
|
139.1 KB
|
|
|
12. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
12. Problem Set 8.html
|
HTML
|
1.4 KB
|
|
|
12.1 Hints.pdf
|
PDF
|
62.7 KB
|
|
|
12.2 Solutions.pdf
|
PDF
|
144.7 KB
|
|
|
13. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
13.1 Hints.pdf
|
PDF
|
97.9 KB
|
|
|
13.2 Solutions.pdf
|
PDF
|
156.9 KB
|
|
|
2. Backtracking Introduction.mp4
|
MP4
|
59.7 MB
|
|
|
2. Backtracking Introduction.srt
|
SRT
|
4.1 KB
|
|
|
2. Binary Search the Answer.mp4
|
MP4
|
122.6 MB
|
|
|
2. Binary Search the Answer.srt
|
SRT
|
12.7 KB
|
|
|
2. Binary Search.mp4
|
MP4
|
118.2 MB
|
|
|
2. Binary Search.srt
|
SRT
|
15.9 KB
|
|
|
2. Bottom-Up Fibonacci.mp4
|
MP4
|
88.2 MB
|
|
|
2. Bottom-Up Fibonacci.srt
|
SRT
|
6.7 KB
|
|
|
2. Course Prerequisites.html
|
HTML
|
921.6 B
|
|
|
2. DP on Strings Edit Distance.mp4
|
MP4
|
113.3 MB
|
|
|
2. DP on Strings Edit Distance.srt
|
SRT
|
12.1 KB
|
|
|
2. Extra Handling Collisions.mp4
|
MP4
|
36.8 MB
|
|
|
2. Extra Handling Collisions.srt
|
SRT
|
2.4 KB
|
|
|
2. Graph Representation.mp4
|
MP4
|
123 MB
|
|
|
2. Graph Representation.srt
|
SRT
|
11.7 KB
|
|
|
2. Greedy Coin Change.mp4
|
MP4
|
129.3 MB
|
|
|
2. Greedy Coin Change.srt
|
SRT
|
14.8 KB
|
|
|
2. How to Always Win in 1-2-3.mp4
|
MP4
|
60 MB
|
|
|
2. How to Always Win in 1-2-3.srt
|
SRT
|
8.7 KB
|
|
|
2. Problem Set 16.html
|
HTML
|
819.2 B
|
|
|
2. Queues.mp4
|
MP4
|
125.1 MB
|
|
|
2. Queues.srt
|
SRT
|
15.3 KB
|
|
|
2. Shortest Paths.mp4
|
MP4
|
104.8 MB
|
|
|
2. Shortest Paths.srt
|
SRT
|
10.5 KB
|
|
|
2. Single-Source Shortest Paths Dijkstra.mp4
|
MP4
|
234.9 MB
|
|
|
2. Single-Source Shortest Paths Dijkstra.srt
|
SRT
|
23.9 KB
|
|
|
2. Sorting in C++ Using Custom Comparators.mp4
|
MP4
|
38.2 MB
|
|
|
2. Sorting in C++ Using Custom Comparators.srt
|
SRT
|
3.6 KB
|
|
|
2. Speeding Up UFDS.mp4
|
MP4
|
85.9 MB
|
|
|
2. Speeding Up UFDS.srt
|
SRT
|
7.7 KB
|
|
|
2. Topological Sort.mp4
|
MP4
|
180.1 MB
|
|
|
2. Topological Sort.srt
|
SRT
|
19.5 KB
|
|
|
2.1 This modification of Dijkstra (the idea of the video, not the code) comes from CP3, one of the books of the CP series by Felix & Steven Halim, which changed the techniques used for CP. Here is the link to the book, in case you are interested..html
|
HTML
|
0 B
|
|
|
2.1 horsesFunction.cpp
|
CPP
|
2.8 KB
|
|
|
2.1 udemySection10StoringGraphs.cpp
|
CPP
|
614.4 B
|
|
|
2.1 udemySection11TopologicalSort.cpp
|
CPP
|
1.6 KB
|
|
|
2.1 udemySection13ShortestPaths.cpp
|
CPP
|
1 KB
|
|
|
2.1 udemySection14UFDSOptimised.cpp
|
CPP
|
819.2 B
|
|
|
2.1 udemySection15EditDistance.cpp
|
CPP
|
819.2 B
|
|
|
2.1 udemySection3BinarySearch.cpp
|
CPP
|
716.8 B
|
|
|
2.1 udemySection6GreedyCoinChange.cpp
|
CPP
|
1.1 KB
|
|
|
2.1 udemySection8BinarySearchAnswer.cpp
|
CPP
|
614.4 B
|
|
|
2.1 udemySection9BottomUpFibonacci.cpp
|
CPP
|
409.6 B
|
|
|
2.2 udemySection12Dijkstra.cpp
|
CPP
|
1.5 KB
|
|
|
3. All-Pairs Shortest Paths Floyd-Warshall's.mp4
|
MP4
|
138.5 MB
|
|
|
3. All-Pairs Shortest Paths Floyd-Warshall's.srt
|
SRT
|
14.9 KB
|
|
|
3. Backtracking Permutations.mp4
|
MP4
|
77.3 MB
|
|
|
3. Backtracking Permutations.srt
|
SRT
|
9.7 KB
|
|
|
3. Course Structure.mp4
|
MP4
|
59 MB
|
|
|
3. Course Structure.srt
|
SRT
|
4.1 KB
|
|
|
3. DP on Strings Longest Palindromic Substring.mp4
|
MP4
|
92.2 MB
|
|
|
3. DP on Strings Longest Palindromic Substring.srt
|
SRT
|
9.9 KB
|
|
|
3. Demonstrating Correctness Under Contest Time Pressure.mp4
|
MP4
|
269.2 MB
|
|
|
3. Demonstrating Correctness Under Contest Time Pressure.srt
|
SRT
|
18.6 KB
|
|
|
3. Depth-First Search.mp4
|
MP4
|
110.5 MB
|
|
|
3. Depth-First Search.srt
|
SRT
|
11.4 KB
|
|
|
3. Hash Tables and Hash Sets Introduction.mp4
|
MP4
|
67.8 MB
|
|
|
3. Hash Tables and Hash Sets Introduction.srt
|
SRT
|
4.4 KB
|
|
|
3. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
3. How to Recognise and Approach DP Problems.mp4
|
MP4
|
184.9 MB
|
|
|
3. How to Recognise and Approach DP Problems.srt
|
SRT
|
12.9 KB
|
|
|
3. QuickSelect.mp4
|
MP4
|
73.3 MB
|
|
|
3. QuickSelect.srt
|
SRT
|
9.2 KB
|
|
|
3. Rabin-Karp Case Study Pattern Search.mp4
|
MP4
|
95.9 MB
|
|
|
3. Rabin-Karp Case Study Pattern Search.srt
|
SRT
|
10.9 KB
|
|
|
3. Strongly Connected Components.mp4
|
MP4
|
125.2 MB
|
|
|
3. Strongly Connected Components.srt
|
SRT
|
17.4 KB
|
|
|
3. Structs and Overloading Comparison Operators.mp4
|
MP4
|
50.7 MB
|
|
|
3. Structs and Overloading Comparison Operators.srt
|
SRT
|
5.7 KB
|
|
|
3. The Bisection Method.mp4
|
MP4
|
99.8 MB
|
|
|
3. The Bisection Method.srt
|
SRT
|
10.8 KB
|
|
|
3. Tic Tac Toe AI 1 Introduction to the Project.mp4
|
MP4
|
28.6 MB
|
|
|
3. Tic Tac Toe AI 1 Introduction to the Project.srt
|
SRT
|
2.1 KB
|
|
|
3. Tree Diameter.mp4
|
MP4
|
59.8 MB
|
|
|
3. Tree Diameter.srt
|
SRT
|
5.9 KB
|
|
|
3. UFDS VS Finding Connected Components.mp4
|
MP4
|
45.6 MB
|
|
|
3. UFDS VS Finding Connected Components.srt
|
SRT
|
3.3 KB
|
|
|
3.1 Extra resource.html
|
HTML
|
102.4 B
|
|
|
3.1 Hints.pdf
|
PDF
|
66.5 KB
|
|
|
3.1 In case you want to submit your own implementation, here is an online judge which checks submissions of Rabin-Karp.html
|
HTML
|
102.4 B
|
|
|
3.1 Proof.html
|
HTML
|
102.4 B
|
|
|
3.1 This article series is a useful reference to learn about an alternative implementation and its details.html
|
HTML
|
102.4 B
|
|
|
3.1 bisection.mp4
|
MP4
|
48.4 MB
|
|
|
3.1 horsesOverloading.cpp
|
CPP
|
2.9 KB
|
|
|
3.1 udemySection10DFS.cpp
|
CPP
|
819.2 B
|
|
|
3.1 udemySection12APSP.cpp
|
CPP
|
1 KB
|
|
|
3.1 udemySection13Diameter.cpp
|
CPP
|
1.1 KB
|
|
|
3.1 udemySection15LongestPalindromicSubstring.cpp
|
CPP
|
1.5 KB
|
|
|
3.1 udemySection7Permutations.cpp
|
CPP
|
921.6 B
|
|
|
3.2 More information on accuracy.html
|
HTML
|
102.4 B
|
|
|
3.2 Solutions.pdf
|
PDF
|
151.5 KB
|
|
|
3.2 udemySection11SCCs.cpp
|
CPP
|
1.7 KB
|
|
|
3.2 udemySection3QuickSelect.cpp
|
CPP
|
1.2 KB
|
|
|
3.2 udemySection5StringSearch.cpp
|
CPP
|
2.1 KB
|
|
|
4. Backtracking Subsets.mp4
|
MP4
|
46.9 MB
|
|
|
4. Backtracking Subsets.srt
|
SRT
|
5.7 KB
|
|
|
4. Bellman-Ford and Negative-Weight Cycles.mp4
|
MP4
|
141.7 MB
|
|
|
4. Bellman-Ford and Negative-Weight Cycles.srt
|
SRT
|
15.3 KB
|
|
|
4. Breadth-First Search.mp4
|
MP4
|
96.8 MB
|
|
|
4. Breadth-First Search.srt
|
SRT
|
9.9 KB
|
|
|
4. Example Application Kruskal's Algorithm.mp4
|
MP4
|
122.9 MB
|
|
|
4. Example Application Kruskal's Algorithm.srt
|
SRT
|
11.5 KB
|
|
|
4. Farewell and Next Steps.mp4
|
MP4
|
64.1 MB
|
|
|
4. Farewell and Next Steps.srt
|
SRT
|
4.3 KB
|
|
|
4. Maximum One-Dimensional Range Sum.mp4
|
MP4
|
115.2 MB
|
|
|
4. Maximum One-Dimensional Range Sum.srt
|
SRT
|
12.8 KB
|
|
|
4. Merge Sort.mp4
|
MP4
|
145.1 MB
|
|
|
4. Merge Sort.srt
|
SRT
|
16.7 KB
|
|
|
4. Minimum Spanning Trees Prim's Algorithm.mp4
|
MP4
|
182.2 MB
|
|
|
4. Minimum Spanning Trees Prim's Algorithm.srt
|
SRT
|
16.8 KB
|
|
|
4. Problem Set 7.html
|
HTML
|
819.2 B
|
|
|
4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.mp4
|
MP4
|
109.8 MB
|
|
|
4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.srt
|
SRT
|
10.5 KB
|
|
|
4. Single-Source Shortest Paths BFS.mp4
|
MP4
|
74.9 MB
|
|
|
4. Single-Source Shortest Paths BFS.srt
|
SRT
|
8.5 KB
|
|
|
4. Suffix Tries.mp4
|
MP4
|
148.4 MB
|
|
|
4. Suffix Tries.srt
|
SRT
|
15.7 KB
|
|
|
4. Tic Tac Toe AI 2 Program Structure.mp4
|
MP4
|
72.6 MB
|
|
|
4. Tic Tac Toe AI 2 Program Structure.srt
|
SRT
|
7.6 KB
|
|
|
4. Timetable Problem.mp4
|
MP4
|
117 MB
|
|
|
4. Timetable Problem.srt
|
SRT
|
12.5 KB
|
|
|
4. Two Pointer Technique Start+End.mp4
|
MP4
|
67.7 MB
|
|
|
4. Two Pointer Technique Start+End.srt
|
SRT
|
8.7 KB
|
|
|
4. Unordered (Hash) Sets and Maps in C++.mp4
|
MP4
|
95.7 MB
|
|
|
4. Unordered (Hash) Sets and Maps in C++.srt
|
SRT
|
11 KB
|
|
|
4. What is an Online Judge.mp4
|
MP4
|
116.6 MB
|
|
|
4. What is an Online Judge.srt
|
SRT
|
7.6 KB
|
|
|
4.1 Also, I have never seen a problem which required multimaps but here they are.html
|
HTML
|
102.4 B
|
|
|
4.1 Extra examples.html
|
HTML
|
102.4 B
|
|
|
4.1 Extra rigorous proof technique.html
|
HTML
|
102.4 B
|
|
|
4.1 udemySection10BFS.cpp
|
CPP
|
819.2 B
|
|
|
4.1 udemySection11SSSP.cpp
|
CPP
|
921.6 B
|
|
|
4.1 udemySection12BellmanFord.cpp
|
CPP
|
1.1 KB
|
|
|
4.1 udemySection13Prim.cpp
|
CPP
|
1.1 KB
|
|
|
4.1 udemySection14Kruskal.cpp
|
CPP
|
1.2 KB
|
|
|
4.1 udemySection15Trie.cpp
|
CPP
|
1.3 KB
|
|
|
4.1 udemySection16TicTacToe.cpp
|
CPP
|
4.3 KB
|
|
|
4.1 udemySection2MergeSort.cpp
|
CPP
|
1.2 KB
|
|
|
4.1 udemySection7Subsets.cpp
|
CPP
|
614.4 B
|
|
|
4.1 udemySection9Max1DRangeSum.cpp
|
CPP
|
614.4 B
|
|
|
4.2 Reference on multisets in case you are interested. There is rarely a problem for which they are useful, but they might be worth knowing, as their operations are similar to those of regular C++ sets.html
|
HTML
|
0 B
|
|
|
4.2 udemySection3TwoPointer.cpp
|
CPP
|
512 B
|
|
|
4.2 udemySection6Timetable.cpp
|
CPP
|
1.3 KB
|
|
|
5. Case Study Arbitrages and the Logarithm Trick.mp4
|
MP4
|
200.5 MB
|
|
|
5. Case Study Arbitrages and the Logarithm Trick.srt
|
SRT
|
20.4 KB
|
|
|
5. Farthest Node BFS Application.mp4
|
MP4
|
69.8 MB
|
|
|
5. Farthest Node BFS Application.srt
|
SRT
|
0 B
|
|
|
5. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
5. Interval Covering.mp4
|
MP4
|
109.6 MB
|
|
|
5. Interval Covering.srt
|
SRT
|
9.6 KB
|
|
|
5. Minimum Spanning Trees Variants.mp4
|
MP4
|
57.2 MB
|
|
|
5. Minimum Spanning Trees Variants.srt
|
SRT
|
6.6 KB
|
|
|
5. Online Judge Verdicts.html
|
HTML
|
1.1 KB
|
|
|
5. Ordered Sets and Maps.mp4
|
MP4
|
96.7 MB
|
|
|
5. Ordered Sets and Maps.srt
|
SRT
|
11 KB
|
|
|
5. Problem Set 10.html
|
HTML
|
1 KB
|
|
|
5. Problem Set 12.html
|
HTML
|
614.4 B
|
|
|
5. Pruning Card Game.mp4
|
MP4
|
129.3 MB
|
|
|
5. Pruning Card Game.srt
|
SRT
|
11.3 KB
|
|
|
5. QuickSort.mp4
|
MP4
|
109.7 MB
|
|
|
5. QuickSort.srt
|
SRT
|
13.8 KB
|
|
|
5. Rabin-Karp Case Study Sliding Window Technique.mp4
|
MP4
|
101.3 MB
|
|
|
5. Rabin-Karp Case Study Sliding Window Technique.srt
|
SRT
|
9.7 KB
|
|
|
5. Representing a Dictionary Using a Trie.mp4
|
MP4
|
52.1 MB
|
|
|
5. Representing a Dictionary Using a Trie.srt
|
SRT
|
6.2 KB
|
|
|
5. Space Optimisation.mp4
|
MP4
|
118.5 MB
|
|
|
5. Space Optimisation.srt
|
SRT
|
13.8 KB
|
|
|
5. Tic Tac Toe AI 3 Helper Functions.mp4
|
MP4
|
135.2 MB
|
|
|
5. Tic Tac Toe AI 3 Helper Functions.srt
|
SRT
|
13 KB
|
|
|
5. Two Pointer Technique Different Paces.mp4
|
MP4
|
68.1 MB
|
|
|
5. Two Pointer Technique Different Paces.srt
|
SRT
|
8 KB
|
|
|
5.1 Card_Game.pdf
|
PDF
|
56.9 KB
|
|
|
5.1 Extra resource.html
|
HTML
|
102.4 B
|
|
|
5.1 Hints.pdf
|
PDF
|
97.4 KB
|
|
|
5.1 udemySection10FarthestNode.cpp
|
CPP
|
10.8 KB
|
|
|
5.1 udemySection12Arbitrages.cpp
|
CPP
|
1.4 KB
|
|
|
5.1 udemySection14MSTVariants.cpp
|
CPP
|
3.1 KB
|
|
|
5.1 udemySection15Dictionary.cpp
|
CPP
|
1.4 KB
|
|
|
5.1 udemySection3TwoPointerP2.cpp
|
CPP
|
921.6 B
|
|
|
5.1 udemySection4Ordered.cpp
|
CPP
|
1.1 KB
|
|
|
5.1 udemySection6IntervalCovering.cpp
|
CPP
|
1 KB
|
|
|
5.1 udemySection9SpaceOptimisation.cpp
|
CPP
|
1.2 KB
|
|
|
5.2 Solutions.pdf
|
PDF
|
152.8 KB
|
|
|
5.2 udemySection2QuickSort.cpp
|
CPP
|
819.2 B
|
|
|
5.2 udemySection7Pruning.cpp
|
CPP
|
1.5 KB
|
|
|
6. DNA Sorting Problem.mp4
|
MP4
|
32 MB
|
|
|
6. DNA Sorting Problem.srt
|
SRT
|
2.2 KB
|
|
|
6. Dictionaries.mp4
|
MP4
|
45.8 MB
|
|
|
6. Dictionaries.srt
|
SRT
|
5.4 KB
|
|
|
6. From Suffix Tries to Suffix Trees.mp4
|
MP4
|
24.5 MB
|
|
|
6. From Suffix Tries to Suffix Trees.srt
|
SRT
|
2.5 KB
|
|
|
6. Graph Sums DFS Application.mp4
|
MP4
|
95.1 MB
|
|
|
6. Graph Sums DFS Application.srt
|
SRT
|
9.8 KB
|
|
|
6. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
6. Iterative Complete Search.mp4
|
MP4
|
55.3 MB
|
|
|
6. Iterative Complete Search.srt
|
SRT
|
5.4 KB
|
|
|
6. Optimal Coin Change 1.mp4
|
MP4
|
106.2 MB
|
|
|
6. Optimal Coin Change 1.srt
|
SRT
|
12.3 KB
|
|
|
6. Problem Set 11.html
|
HTML
|
716.8 B
|
|
|
6. Problem Set 13.html
|
HTML
|
921.6 B
|
|
|
6. Problem Set 2.html
|
HTML
|
716.8 B
|
|
|
6. Sliding Window Technique Subarray Sums.mp4
|
MP4
|
94.8 MB
|
|
|
6. Sliding Window Technique Subarray Sums.srt
|
SRT
|
10 KB
|
|
|
6. Sort - Solve.mp4
|
MP4
|
29.3 MB
|
|
|
6. Sort - Solve.srt
|
SRT
|
2.2 KB
|
|
|
6. Tic Tac Toe AI 4 Minimax.mp4
|
MP4
|
203.4 MB
|
|
|
6. Tic Tac Toe AI 4 Minimax.srt
|
SRT
|
20.1 KB
|
|
|
6. Types of Problem in Programming Contests.mp4
|
MP4
|
107.6 MB
|
|
|
6. Types of Problem in Programming Contests.srt
|
SRT
|
7.2 KB
|
|
|
6.1 Hints.pdf
|
PDF
|
70.7 KB
|
|
|
6.1 dna.txt
|
TXT
|
27.8 KB
|
|
|
6.1 udemySection10GraphSums.cpp
|
CPP
|
1 KB
|
|
|
6.1 udemySection4Dicts.cpp
|
CPP
|
1.4 KB
|
|
|
6.1 udemySection5SlidingWindow.cpp
|
CPP
|
512 B
|
|
|
6.1 udemySection7IterativeCompleteSearch.cpp
|
CPP
|
819.2 B
|
|
|
6.1 udemySection9CoinChange.cpp
|
CPP
|
819.2 B
|
|
|
6.2 Solutions.pdf
|
PDF
|
137.4 KB
|
|
|
6.2 udemySection10GraphSumsShort.cpp
|
CPP
|
614.4 B
|
|
|
7. Connected Components.mp4
|
MP4
|
86.9 MB
|
|
|
7. Connected Components.srt
|
SRT
|
12.2 KB
|
|
|
7. Coordinate compression.mp4
|
MP4
|
76.1 MB
|
|
|
7. Coordinate compression.srt
|
SRT
|
5.5 KB
|
|
|
7. Count Sort.mp4
|
MP4
|
48.1 MB
|
|
|
7. Count Sort.srt
|
SRT
|
5.3 KB
|
|
|
7. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
7. IO for Competitive Programming.html
|
HTML
|
1.6 KB
|
|
|
7. Optimal Coin Change 2.mp4
|
MP4
|
175.2 MB
|
|
|
7. Optimal Coin Change 2.srt
|
SRT
|
19.4 KB
|
|
|
7. Problem Set 4.html
|
HTML
|
512 B
|
|
|
7. Problem Set 5.html
|
HTML
|
1.1 KB
|
|
|
7. Problem Set 6.html
|
HTML
|
716.8 B
|
|
|
7. Suffix Trees Insertion.mp4
|
MP4
|
196.3 MB
|
|
|
7. Suffix Trees Insertion.srt
|
SRT
|
15.3 KB
|
|
|
7. Tic Tac Toe AI 5 Recovering the Optimal Move.mp4
|
MP4
|
53.4 MB
|
|
|
7. Tic Tac Toe AI 5 Recovering the Optimal Move.srt
|
SRT
|
5.7 KB
|
|
|
7.1 Hints.pdf
|
PDF
|
59.8 KB
|
|
|
7.1 Out of the scope of the course if the contest has a tight time limit, you may need a faster implementation, similar to the one below.html
|
HTML
|
102.4 B
|
|
|
7.1 dnaCountSort.cpp
|
CPP
|
716.8 B
|
|
|
7.1 udemySection10ConnectedComponents.cpp
|
CPP
|
716.8 B
|
|
|
7.2 Solutions.pdf
|
PDF
|
109.9 KB
|
|
|
7.2 udemySection15SuffixTree.cpp
|
CPP
|
3.5 KB
|
|
|
8. Backtracking to Find Solutions.mp4
|
MP4
|
70.4 MB
|
|
|
8. Backtracking to Find Solutions.srt
|
SRT
|
6.9 KB
|
|
|
8. Custom Comparators for STL Data Structures.mp4
|
MP4
|
80.6 MB
|
|
|
8. Custom Comparators for STL Data Structures.srt
|
SRT
|
11.4 KB
|
|
|
8. Football Problem.mp4
|
MP4
|
30.6 MB
|
|
|
8. Football Problem.srt
|
SRT
|
1.9 KB
|
|
|
8. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
8. Labyrinth Problem Part 1 Single-Source BFS.mp4
|
MP4
|
114.7 MB
|
|
|
8. Labyrinth Problem Part 1 Single-Source BFS.srt
|
SRT
|
11.5 KB
|
|
|
8. Problem Set 15.html
|
HTML
|
819.2 B
|
|
|
8. Suffix Trees Other Operations.mp4
|
MP4
|
76.9 MB
|
|
|
8. Suffix Trees Other Operations.srt
|
SRT
|
5.9 KB
|
|
|
8. Welcome Contest.html
|
HTML
|
819.2 B
|
|
|
8.1 Hints.pdf
|
PDF
|
57.6 KB
|
|
|
8.1 footballData.txt
|
TXT
|
77 KB
|
|
|
8.1 udemySection10Labyrinth.cpp
|
CPP
|
1 KB
|
|
|
8.1 udemySection4CustomComparators.cpp
|
CPP
|
1.1 KB
|
|
|
8.1 udemySection9Backtracking.cpp
|
CPP
|
1.4 KB
|
|
|
8.2 Solutions.pdf
|
PDF
|
116 KB
|
|
|
9. Bucket Sort.mp4
|
MP4
|
78.7 MB
|
|
|
9. Bucket Sort.srt
|
SRT
|
5.2 KB
|
|
|
9. Hints and Solutions.html
|
HTML
|
102.4 B
|
|
|
9. Labyrinth Problem Part 2 Multi-Source BFS.mp4
|
MP4
|
85.9 MB
|
|
|
9. Labyrinth Problem Part 2 Multi-Source BFS.srt
|
SRT
|
8.6 KB
|
|
|
9. Prefix Sums.mp4
|
MP4
|
78.3 MB
|
|
|
9. Prefix Sums.srt
|
SRT
|
7 KB
|
|
|
9. Problem Set 14.html
|
HTML
|
716.8 B
|
|
|
9. Problem Set 3.html
|
HTML
|
1.2 KB
|
|
|
9.1 Hints.pdf
|
PDF
|
66.7 KB
|
|
|
9.1 udemySection10Labyrinth2.cpp
|
CPP
|
1.2 KB
|
|
|
9.1 udemySection9PrefixSums.cpp
|
CPP
|
512 B
|
|
|
9.2 Solutions.pdf
|
PDF
|
133 KB
|
|
|
[Tutorialsplanet.NET].url
|
URL
|
102.4 B
|
