| 1. About the Instructor.mp4 | 133.3 MB | ||
| 1. About the Instructor.srt | 9.1 KB | ||
| 1. Complete Search Introduction.mp4 | 34.5 MB | ||
| 1. Complete Search Introduction.srt | 2.5 KB | ||
| 1. DP on Strings Longest Common Subsequence.mp4 | 127.7 MB | ||
| 1. DP on Strings Longest Common Subsequence.srt | 14 KB | ||
| 1. Exploring Directed Graphs.mp4 | 161.7 MB | ||
| 1. Exploring Directed Graphs.srt | 17 KB | ||
| 1. Graph Terminology.mp4 | 40.5 MB | ||
| 1. Graph Terminology.srt | 4.8 KB | ||
| 1. Hash Functions.mp4 | 60.7 MB | ||
| 1. Hash Functions.srt | 9.7 KB | ||
| 1. How To Approach Interactive Problems.mp4 | 102.7 MB | ||
| 1. How To Approach Interactive Problems.srt | 6.9 KB | ||
| 1. Introduction to Section 2 and the Horse Race Problem.mp4 | 103.8 MB | ||
| 1. Introduction to Section 2 and the Horse Race Problem.srt | 10.8 KB | ||
| 1. Linear Search.mp4 | 68.8 MB | ||
| 1. Linear Search.srt | 9.9 KB | ||
| 1. Revisiting Sections 2 and 3.mp4 | 102.8 MB | ||
| 1. Revisiting Sections 2 and 3.srt | 6.9 KB | ||
| 1. Stacks bracket matching.mp4 | 117.6 MB | ||
| 1. Stacks bracket matching.srt | 13.5 KB | ||
| 1. States and Transitions.mp4 | 50.3 MB | ||
| 1. States and Transitions.srt | 3.2 KB | ||
| 1. Top-Down Fibonacci.mp4 | 186.8 MB | ||
| 1. Top-Down Fibonacci.srt | 13.2 KB | ||
| 1. UFDS Introduction.mp4 | 143.4 MB | ||
| 1. UFDS Introduction.srt | 14.5 KB | ||
| 1. Weighted Graphs.mp4 | 79 MB | ||
| 1. Weighted Graphs.srt | 5.6 KB | ||
| 1. What Makes Trees Special.mp4 | 38.2 MB | ||
| 1. What Makes Trees Special.srt | 2.8 KB | ||
| 1. What are Greedy Algorithms.mp4 | 76.1 MB | ||
| 1. What are Greedy Algorithms.srt | 5.4 KB | ||
| 1.1 Horses.pdf | 51.4 KB | ||
| 1.1 Problem to submit code to. Note all operations described are O(1) in C++..html | 102.4 B | ||
| 1.1 udemySection10ExploringDirectedGraphs.cpp | 1.1 KB | ||
| 1.1 udemySection14UFDSIntro.cpp | 614.4 B | ||
| 1.1 udemySection15LCS.cpp | 716.8 B | ||
| 1.1 udemySection3LinearSearch.cpp | 307.2 B | ||
| 1.1 udemySection5HashFunctions.cpp | 307.2 B | ||
| 1.1 udemySection9TopDownFibonacci.cpp | 409.6 B | ||
| 1.2 Why Choose a Prime Cardinality.html | 102.4 B | ||
| 1.2 udemySection4Stacks.cpp | 1.4 KB | ||
| 10. Bucket Sort Solution to the Football Problem.mp4 | 63.9 MB | ||
| 10. Bucket Sort Solution to the Football Problem.srt | 6.5 KB | ||
| 10. Hints and Solutions.html | 102.4 B | ||
| 10. Horses Problem Revisited.mp4 | 110.4 MB | ||
| 10. Horses Problem Revisited.srt | 10 KB | ||
| 10. Problem Set 9.html | 819.2 B | ||
| 10.1 Hints.pdf | 52 KB | ||
| 10.1 footballers.cpp | 1.7 KB | ||
| 10.2 Solutions.pdf | 113.7 KB | ||
| 11. Hints and Solutions.html | 102.4 B | ||
| 11. Horses Addendum.mp4 | 44.6 MB | ||
| 11. Horses Addendum.srt | 4.3 KB | ||
| 11. Problem Set 1.html | 1 KB | ||
| 11.1 Hints.pdf | 72.7 KB | ||
| 11.2 Solutions.pdf | 139.1 KB | ||
| 12. Hints and Solutions.html | 102.4 B | ||
| 12. Problem Set 8.html | 1.4 KB | ||
| 12.1 Hints.pdf | 62.7 KB | ||
| 12.2 Solutions.pdf | 144.7 KB | ||
| 13. Hints and Solutions.html | 102.4 B | ||
| 13.1 Hints.pdf | 97.9 KB | ||
| 13.2 Solutions.pdf | 156.9 KB | ||
| 2. Backtracking Introduction.mp4 | 59.7 MB | ||
| 2. Backtracking Introduction.srt | 4.1 KB | ||
| 2. Binary Search the Answer.mp4 | 122.6 MB | ||
| 2. Binary Search the Answer.srt | 12.7 KB | ||
| 2. Binary Search.mp4 | 118.2 MB | ||
| 2. Binary Search.srt | 15.9 KB | ||
| 2. Bottom-Up Fibonacci.mp4 | 88.2 MB | ||
| 2. Bottom-Up Fibonacci.srt | 6.7 KB | ||
| 2. Course Prerequisites.html | 921.6 B | ||
| 2. DP on Strings Edit Distance.mp4 | 113.3 MB | ||
| 2. DP on Strings Edit Distance.srt | 12.1 KB | ||
| 2. Extra Handling Collisions.mp4 | 36.8 MB | ||
| 2. Extra Handling Collisions.srt | 2.4 KB | ||
| 2. Graph Representation.mp4 | 123 MB | ||
| 2. Graph Representation.srt | 11.7 KB | ||
| 2. Greedy Coin Change.mp4 | 129.3 MB | ||
| 2. Greedy Coin Change.srt | 14.8 KB | ||
| 2. How to Always Win in 1-2-3.mp4 | 60 MB | ||
| 2. How to Always Win in 1-2-3.srt | 8.7 KB | ||
| 2. Problem Set 16.html | 819.2 B | ||
| 2. Queues.mp4 | 125.1 MB | ||
| 2. Queues.srt | 15.3 KB | ||
| 2. Shortest Paths.mp4 | 104.8 MB | ||
| 2. Shortest Paths.srt | 10.5 KB | ||
| 2. Single-Source Shortest Paths Dijkstra.mp4 | 234.9 MB | ||
| 2. Single-Source Shortest Paths Dijkstra.srt | 23.9 KB | ||
| 2. Sorting in C++ Using Custom Comparators.mp4 | 38.2 MB | ||
| 2. Sorting in C++ Using Custom Comparators.srt | 3.6 KB | ||
| 2. Speeding Up UFDS.mp4 | 85.9 MB | ||
| 2. Speeding Up UFDS.srt | 7.7 KB | ||
| 2. Topological Sort.mp4 | 180.1 MB | ||
| 2. Topological Sort.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 | 0 B | ||
| 2.1 horsesFunction.cpp | 2.8 KB | ||
| 2.1 udemySection10StoringGraphs.cpp | 614.4 B | ||
| 2.1 udemySection11TopologicalSort.cpp | 1.6 KB | ||
| 2.1 udemySection13ShortestPaths.cpp | 1 KB | ||
| 2.1 udemySection14UFDSOptimised.cpp | 819.2 B | ||
| 2.1 udemySection15EditDistance.cpp | 819.2 B | ||
| 2.1 udemySection3BinarySearch.cpp | 716.8 B | ||
| 2.1 udemySection6GreedyCoinChange.cpp | 1.1 KB | ||
| 2.1 udemySection8BinarySearchAnswer.cpp | 614.4 B | ||
| 2.1 udemySection9BottomUpFibonacci.cpp | 409.6 B | ||
| 2.2 udemySection12Dijkstra.cpp | 1.5 KB | ||
| 3. All-Pairs Shortest Paths Floyd-Warshall's.mp4 | 138.5 MB | ||
| 3. All-Pairs Shortest Paths Floyd-Warshall's.srt | 14.9 KB | ||
| 3. Backtracking Permutations.mp4 | 77.3 MB | ||
| 3. Backtracking Permutations.srt | 9.7 KB | ||
| 3. Course Structure.mp4 | 59 MB | ||
| 3. Course Structure.srt | 4.1 KB | ||
| 3. DP on Strings Longest Palindromic Substring.mp4 | 92.2 MB | ||
| 3. DP on Strings Longest Palindromic Substring.srt | 9.9 KB | ||
| 3. Demonstrating Correctness Under Contest Time Pressure.mp4 | 269.2 MB | ||
| 3. Demonstrating Correctness Under Contest Time Pressure.srt | 18.6 KB | ||
| 3. Depth-First Search.mp4 | 110.5 MB | ||
| 3. Depth-First Search.srt | 11.4 KB | ||
| 3. Hash Tables and Hash Sets Introduction.mp4 | 67.8 MB | ||
| 3. Hash Tables and Hash Sets Introduction.srt | 4.4 KB | ||
| 3. Hints and Solutions.html | 102.4 B | ||
| 3. How to Recognise and Approach DP Problems.mp4 | 184.9 MB | ||
| 3. How to Recognise and Approach DP Problems.srt | 12.9 KB | ||
| 3. QuickSelect.mp4 | 73.3 MB | ||
| 3. QuickSelect.srt | 9.2 KB | ||
| 3. Rabin-Karp Case Study Pattern Search.mp4 | 95.9 MB | ||
| 3. Rabin-Karp Case Study Pattern Search.srt | 10.9 KB | ||
| 3. Strongly Connected Components.mp4 | 125.2 MB | ||
| 3. Strongly Connected Components.srt | 17.4 KB | ||
| 3. Structs and Overloading Comparison Operators.mp4 | 50.7 MB | ||
| 3. Structs and Overloading Comparison Operators.srt | 5.7 KB | ||
| 3. The Bisection Method.mp4 | 99.8 MB | ||
| 3. The Bisection Method.srt | 10.8 KB | ||
| 3. Tic Tac Toe AI 1 Introduction to the Project.mp4 | 28.6 MB | ||
| 3. Tic Tac Toe AI 1 Introduction to the Project.srt | 2.1 KB | ||
| 3. Tree Diameter.mp4 | 59.8 MB | ||
| 3. Tree Diameter.srt | 5.9 KB | ||
| 3. UFDS VS Finding Connected Components.mp4 | 45.6 MB | ||
| 3. UFDS VS Finding Connected Components.srt | 3.3 KB | ||
| 3.1 Extra resource.html | 102.4 B | ||
| 3.1 Hints.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 | 102.4 B | ||
| 3.1 Proof.html | 102.4 B | ||
| 3.1 This article series is a useful reference to learn about an alternative implementation and its details.html | 102.4 B | ||
| 3.1 bisection.mp4 | 48.4 MB | ||
| 3.1 horsesOverloading.cpp | 2.9 KB | ||
| 3.1 udemySection10DFS.cpp | 819.2 B | ||
| 3.1 udemySection12APSP.cpp | 1 KB | ||
| 3.1 udemySection13Diameter.cpp | 1.1 KB | ||
| 3.1 udemySection15LongestPalindromicSubstring.cpp | 1.5 KB | ||
| 3.1 udemySection7Permutations.cpp | 921.6 B | ||
| 3.2 More information on accuracy.html | 102.4 B | ||
| 3.2 Solutions.pdf | 151.5 KB | ||
| 3.2 udemySection11SCCs.cpp | 1.7 KB | ||
| 3.2 udemySection3QuickSelect.cpp | 1.2 KB | ||
| 3.2 udemySection5StringSearch.cpp | 2.1 KB | ||
| 4. Backtracking Subsets.mp4 | 46.9 MB | ||
| 4. Backtracking Subsets.srt | 5.7 KB | ||
| 4. Bellman-Ford and Negative-Weight Cycles.mp4 | 141.7 MB | ||
| 4. Bellman-Ford and Negative-Weight Cycles.srt | 15.3 KB | ||
| 4. Breadth-First Search.mp4 | 96.8 MB | ||
| 4. Breadth-First Search.srt | 9.9 KB | ||
| 4. Example Application Kruskal's Algorithm.mp4 | 122.9 MB | ||
| 4. Example Application Kruskal's Algorithm.srt | 11.5 KB | ||
| 4. Farewell and Next Steps.mp4 | 64.1 MB | ||
| 4. Farewell and Next Steps.srt | 4.3 KB | ||
| 4. Maximum One-Dimensional Range Sum.mp4 | 115.2 MB | ||
| 4. Maximum One-Dimensional Range Sum.srt | 12.8 KB | ||
| 4. Merge Sort.mp4 | 145.1 MB | ||
| 4. Merge Sort.srt | 16.7 KB | ||
| 4. Minimum Spanning Trees Prim's Algorithm.mp4 | 182.2 MB | ||
| 4. Minimum Spanning Trees Prim's Algorithm.srt | 16.8 KB | ||
| 4. Problem Set 7.html | 819.2 B | ||
| 4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.mp4 | 109.8 MB | ||
| 4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.srt | 10.5 KB | ||
| 4. Single-Source Shortest Paths BFS.mp4 | 74.9 MB | ||
| 4. Single-Source Shortest Paths BFS.srt | 8.5 KB | ||
| 4. Suffix Tries.mp4 | 148.4 MB | ||
| 4. Suffix Tries.srt | 15.7 KB | ||
| 4. Tic Tac Toe AI 2 Program Structure.mp4 | 72.6 MB | ||
| 4. Tic Tac Toe AI 2 Program Structure.srt | 7.6 KB | ||
| 4. Timetable Problem.mp4 | 117 MB | ||
| 4. Timetable Problem.srt | 12.5 KB | ||
| 4. Two Pointer Technique Start+End.mp4 | 67.7 MB | ||
| 4. Two Pointer Technique Start+End.srt | 8.7 KB | ||
| 4. Unordered (Hash) Sets and Maps in C++.mp4 | 95.7 MB | ||
| 4. Unordered (Hash) Sets and Maps in C++.srt | 11 KB | ||
| 4. What is an Online Judge.mp4 | 116.6 MB | ||
| 4. What is an Online Judge.srt | 7.6 KB | ||
| 4.1 Also, I have never seen a problem which required multimaps but here they are.html | 102.4 B | ||
| 4.1 Extra examples.html | 102.4 B | ||
| 4.1 Extra rigorous proof technique.html | 102.4 B | ||
| 4.1 udemySection10BFS.cpp | 819.2 B | ||
| 4.1 udemySection11SSSP.cpp | 921.6 B | ||
| 4.1 udemySection12BellmanFord.cpp | 1.1 KB | ||
| 4.1 udemySection13Prim.cpp | 1.1 KB | ||
| 4.1 udemySection14Kruskal.cpp | 1.2 KB | ||
| 4.1 udemySection15Trie.cpp | 1.3 KB | ||
| 4.1 udemySection16TicTacToe.cpp | 4.3 KB | ||
| 4.1 udemySection2MergeSort.cpp | 1.2 KB | ||
| 4.1 udemySection7Subsets.cpp | 614.4 B | ||
| 4.1 udemySection9Max1DRangeSum.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 | 0 B | ||
| 4.2 udemySection3TwoPointer.cpp | 512 B | ||
| 4.2 udemySection6Timetable.cpp | 1.3 KB | ||
| 5. Case Study Arbitrages and the Logarithm Trick.mp4 | 200.5 MB | ||
| 5. Case Study Arbitrages and the Logarithm Trick.srt | 20.4 KB | ||
| 5. Farthest Node BFS Application.mp4 | 69.8 MB | ||
| 5. Farthest Node BFS Application.srt | 0 B | ||
| 5. Hints and Solutions.html | 102.4 B | ||
| 5. Interval Covering.mp4 | 109.6 MB | ||
| 5. Interval Covering.srt | 9.6 KB | ||
| 5. Minimum Spanning Trees Variants.mp4 | 57.2 MB | ||
| 5. Minimum Spanning Trees Variants.srt | 6.6 KB | ||
| 5. Online Judge Verdicts.html | 1.1 KB | ||
| 5. Ordered Sets and Maps.mp4 | 96.7 MB | ||
| 5. Ordered Sets and Maps.srt | 11 KB | ||
| 5. Problem Set 10.html | 1 KB | ||
| 5. Problem Set 12.html | 614.4 B | ||
| 5. Pruning Card Game.mp4 | 129.3 MB | ||
| 5. Pruning Card Game.srt | 11.3 KB | ||
| 5. QuickSort.mp4 | 109.7 MB | ||
| 5. QuickSort.srt | 13.8 KB | ||
| 5. Rabin-Karp Case Study Sliding Window Technique.mp4 | 101.3 MB | ||
| 5. Rabin-Karp Case Study Sliding Window Technique.srt | 9.7 KB | ||
| 5. Representing a Dictionary Using a Trie.mp4 | 52.1 MB | ||
| 5. Representing a Dictionary Using a Trie.srt | 6.2 KB | ||
| 5. Space Optimisation.mp4 | 118.5 MB | ||
| 5. Space Optimisation.srt | 13.8 KB | ||
| 5. Tic Tac Toe AI 3 Helper Functions.mp4 | 135.2 MB | ||
| 5. Tic Tac Toe AI 3 Helper Functions.srt | 13 KB | ||
| 5. Two Pointer Technique Different Paces.mp4 | 68.1 MB | ||
| 5. Two Pointer Technique Different Paces.srt | 8 KB | ||
| 5.1 Card_Game.pdf | 56.9 KB | ||
| 5.1 Extra resource.html | 102.4 B | ||
| 5.1 Hints.pdf | 97.4 KB | ||
| 5.1 udemySection10FarthestNode.cpp | 10.8 KB | ||
| 5.1 udemySection12Arbitrages.cpp | 1.4 KB | ||
| 5.1 udemySection14MSTVariants.cpp | 3.1 KB | ||
| 5.1 udemySection15Dictionary.cpp | 1.4 KB | ||
| 5.1 udemySection3TwoPointerP2.cpp | 921.6 B | ||
| 5.1 udemySection4Ordered.cpp | 1.1 KB | ||
| 5.1 udemySection6IntervalCovering.cpp | 1 KB | ||
| 5.1 udemySection9SpaceOptimisation.cpp | 1.2 KB | ||
| 5.2 Solutions.pdf | 152.8 KB | ||
| 5.2 udemySection2QuickSort.cpp | 819.2 B | ||
| 5.2 udemySection7Pruning.cpp | 1.5 KB | ||
| 6. DNA Sorting Problem.mp4 | 32 MB | ||
| 6. DNA Sorting Problem.srt | 2.2 KB | ||
| 6. Dictionaries.mp4 | 45.8 MB | ||
| 6. Dictionaries.srt | 5.4 KB | ||
| 6. From Suffix Tries to Suffix Trees.mp4 | 24.5 MB | ||
| 6. From Suffix Tries to Suffix Trees.srt | 2.5 KB | ||
| 6. Graph Sums DFS Application.mp4 | 95.1 MB | ||
| 6. Graph Sums DFS Application.srt | 9.8 KB | ||
| 6. Hints and Solutions.html | 102.4 B | ||
| 6. Iterative Complete Search.mp4 | 55.3 MB | ||
| 6. Iterative Complete Search.srt | 5.4 KB | ||
| 6. Optimal Coin Change 1.mp4 | 106.2 MB | ||
| 6. Optimal Coin Change 1.srt | 12.3 KB | ||
| 6. Problem Set 11.html | 716.8 B | ||
| 6. Problem Set 13.html | 921.6 B | ||
| 6. Problem Set 2.html | 716.8 B | ||
| 6. Sliding Window Technique Subarray Sums.mp4 | 94.8 MB | ||
| 6. Sliding Window Technique Subarray Sums.srt | 10 KB | ||
| 6. Sort - Solve.mp4 | 29.3 MB | ||
| 6. Sort - Solve.srt | 2.2 KB | ||
| 6. Tic Tac Toe AI 4 Minimax.mp4 | 203.4 MB | ||
| 6. Tic Tac Toe AI 4 Minimax.srt | 20.1 KB | ||
| 6. Types of Problem in Programming Contests.mp4 | 107.6 MB | ||
| 6. Types of Problem in Programming Contests.srt | 7.2 KB | ||
| 6.1 Hints.pdf | 70.7 KB | ||
| 6.1 dna.txt | 27.8 KB | ||
| 6.1 udemySection10GraphSums.cpp | 1 KB | ||
| 6.1 udemySection4Dicts.cpp | 1.4 KB | ||
| 6.1 udemySection5SlidingWindow.cpp | 512 B | ||
| 6.1 udemySection7IterativeCompleteSearch.cpp | 819.2 B | ||
| 6.1 udemySection9CoinChange.cpp | 819.2 B | ||
| 6.2 Solutions.pdf | 137.4 KB | ||
| 6.2 udemySection10GraphSumsShort.cpp | 614.4 B | ||
| 7. Connected Components.mp4 | 86.9 MB | ||
| 7. Connected Components.srt | 12.2 KB | ||
| 7. Coordinate compression.mp4 | 76.1 MB | ||
| 7. Coordinate compression.srt | 5.5 KB | ||
| 7. Count Sort.mp4 | 48.1 MB | ||
| 7. Count Sort.srt | 5.3 KB | ||
| 7. Hints and Solutions.html | 102.4 B | ||
| 7. IO for Competitive Programming.html | 1.6 KB | ||
| 7. Optimal Coin Change 2.mp4 | 175.2 MB | ||
| 7. Optimal Coin Change 2.srt | 19.4 KB | ||
| 7. Problem Set 4.html | 512 B | ||
| 7. Problem Set 5.html | 1.1 KB | ||
| 7. Problem Set 6.html | 716.8 B | ||
| 7. Suffix Trees Insertion.mp4 | 196.3 MB | ||
| 7. Suffix Trees Insertion.srt | 15.3 KB | ||
| 7. Tic Tac Toe AI 5 Recovering the Optimal Move.mp4 | 53.4 MB | ||
| 7. Tic Tac Toe AI 5 Recovering the Optimal Move.srt | 5.7 KB | ||
| 7.1 Hints.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 | 102.4 B | ||
| 7.1 dnaCountSort.cpp | 716.8 B | ||
| 7.1 udemySection10ConnectedComponents.cpp | 716.8 B | ||
| 7.2 Solutions.pdf | 109.9 KB | ||
| 7.2 udemySection15SuffixTree.cpp | 3.5 KB | ||
| 8. Backtracking to Find Solutions.mp4 | 70.4 MB | ||
| 8. Backtracking to Find Solutions.srt | 6.9 KB | ||
| 8. Custom Comparators for STL Data Structures.mp4 | 80.6 MB | ||
| 8. Custom Comparators for STL Data Structures.srt | 11.4 KB | ||
| 8. Football Problem.mp4 | 30.6 MB | ||
| 8. Football Problem.srt | 1.9 KB | ||
| 8. Hints and Solutions.html | 102.4 B | ||
| 8. Labyrinth Problem Part 1 Single-Source BFS.mp4 | 114.7 MB | ||
| 8. Labyrinth Problem Part 1 Single-Source BFS.srt | 11.5 KB | ||
| 8. Problem Set 15.html | 819.2 B | ||
| 8. Suffix Trees Other Operations.mp4 | 76.9 MB | ||
| 8. Suffix Trees Other Operations.srt | 5.9 KB | ||
| 8. Welcome Contest.html | 819.2 B | ||
| 8.1 Hints.pdf | 57.6 KB | ||
| 8.1 footballData.txt | 77 KB | ||
| 8.1 udemySection10Labyrinth.cpp | 1 KB | ||
| 8.1 udemySection4CustomComparators.cpp | 1.1 KB | ||
| 8.1 udemySection9Backtracking.cpp | 1.4 KB | ||
| 8.2 Solutions.pdf | 116 KB | ||
| 9. Bucket Sort.mp4 | 78.7 MB | ||
| 9. Bucket Sort.srt | 5.2 KB | ||
| 9. Hints and Solutions.html | 102.4 B | ||
| 9. Labyrinth Problem Part 2 Multi-Source BFS.mp4 | 85.9 MB | ||
| 9. Labyrinth Problem Part 2 Multi-Source BFS.srt | 8.6 KB | ||
| 9. Prefix Sums.mp4 | 78.3 MB | ||
| 9. Prefix Sums.srt | 7 KB | ||
| 9. Problem Set 14.html | 716.8 B | ||
| 9. Problem Set 3.html | 1.2 KB | ||
| 9.1 Hints.pdf | 66.7 KB | ||
| 9.1 udemySection10Labyrinth2.cpp | 1.2 KB | ||
| 9.1 udemySection9PrefixSums.cpp | 512 B | ||
| 9.2 Solutions.pdf | 133 KB | ||
| [Tutorialsplanet.NET].url | 102.4 B | ||
| ▲ 363 total files | |||
Udemy - Competitive Programming
There are many tricks which are gained through experience and competitive programmers have a sixth sense when it comes to breaking problems down into the building blocks that make up a solution and which many are reluctant to share. Here I will let you in on the techniques and the applications that are useful for the field, focusing on real problems and how they are solved, while giving you an intuition on what is going on under the hood and why these ideas work.
From dynamic programming to graph algorithms and backtracking, you will get to practise and feel confident about many topics, learning advanced concepts such as union-find disjoint sets, tries and game theory without feeling lost, and to apply new content as soon as you learn it, with over 100 suggested problems, both from past olympiads and online judges and some created by me specifically for this course. All of them come with detailed solutions. With this course, you will be ready to participate in online contests and informatics olympiads, and will have the experience necessary to continue advancing in this field. Are you ready to take this big step in your journey?
For more Udemy Courses: https://tutorialsplanet.net
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 2.4 GB | freecoursewb | 2 weeks | 0 | 0 | |
| 3.5 GB | freecoursewb | 2 weeks | 0 | 0 | |
|
Udemy - IMRaD-Q1 Paper Writing and Publishing with ChatGPT and AI '26 Posted by
freecoursewb in Other
|
846.5 MB | freecoursewb | 2 weeks | 0 | 0 |
| 3.8 GB | freecoursewb | 2 weeks | 0 | 0 | |
| 1.3 GB | freecoursewb | 2 weeks | 0 | 0 |
All Comments