[Tutorialsplanet.NET] Udemy - Competitive Programming - 磁力狗

BT种子名称

请保存以下最新地址

BT种子基本信息

种子哈希：409cb9e3627e7d8df01e6ea2f2e9a7ade335a245
文档大小：10.6 GB
文档个数：363个文档
下载次数：4331次
下载速度：极快
收录时间：2022-01-09
最近下载：2024-12-25
DMCA/屏蔽：DMCA/屏蔽

下载磁力链接

magnet:?xt=urn:btih:409CB9E3627E7D8DF01E6EA2F2E9A7ADE335A245
复制磁力链接到PikPak、utorrent、Bitcomet、迅雷、115、百度网盘等下载工具进行下载。

下载BT种子

磁力链接种子下载迅雷下载二维码 YouTube成人版 91视频 91短视频 51品茶逼哩逼哩萝莉岛欲漫涩草榴社区含羞草抖阴破解版 TikTok成人版成人快手乱伦社区 91AV 暗网禁地

[Tutorialsplanet.NET] Udemy - Competitive Programming的二维码

文档列表

6. Greedy Algorithms/3. Demonstrating Correctness Under Contest Time Pressure.mp4 282.2 MB
12/2. Single-Source Shortest Paths Dijkstra.mp4 246.3 MB
16. Game Theory Minimax and Optimal Game Playing/6. Tic Tac Toe AI 4 Minimax.mp4 213.2 MB
12/5. Case Study Arbitrages and the Logarithm Trick.mp4 210.2 MB
15. Strings, Tries and Trees/7. Suffix Trees Insertion.mp4 205.8 MB
9. Dynamic Programming/1. Top-Down Fibonacci.mp4 195.8 MB
9. Dynamic Programming/3. How to Recognise and Approach DP Problems.mp4 193.8 MB
13. Trees/4. Minimum Spanning Trees Prim's Algorithm.mp4 191.0 MB
11. Graphs 2 Directed Graphs and Cycles/2. Topological Sort.mp4 188.9 MB
9. Dynamic Programming/7. Optimal Coin Change 2.mp4 183.7 MB
11. Graphs 2 Directed Graphs and Cycles/1. Exploring Directed Graphs.mp4 169.6 MB
15. Strings, Tries and Trees/4. Suffix Tries.mp4 155.6 MB
2. Sorting/4. Merge Sort.mp4 152.2 MB
14. Union-Find Disjoint Sets/1. UFDS Introduction.mp4 150.4 MB
12/4. Bellman-Ford and Negative-Weight Cycles.mp4 148.6 MB
12/3. All-Pairs Shortest Paths Floyd-Warshall's.mp4 145.2 MB
16. Game Theory Minimax and Optimal Game Playing/5. Tic Tac Toe AI 3 Helper Functions.mp4 141.7 MB
1. Introduction/1. About the Instructor.mp4 139.8 MB
7. Complete Search/5. Pruning Card Game.mp4 135.6 MB
6. Greedy Algorithms/2. Greedy Coin Change.mp4 135.5 MB
15. Strings, Tries and Trees/1. DP on Strings Longest Common Subsequence.mp4 133.9 MB
11. Graphs 2 Directed Graphs and Cycles/3. Strongly Connected Components.mp4 131.3 MB
4/2. Queues.mp4 131.2 MB
10. Graphs 1 Graph Exploration/2. Graph Representation.mp4 129.0 MB
14. Union-Find Disjoint Sets/4. Example Application Kruskal's Algorithm.mp4 128.9 MB
8. Divide and Conquer/2. Binary Search the Answer.mp4 128.6 MB
9. Dynamic Programming/5. Space Optimisation.mp4 124.2 MB
3. Searching/2. Binary Search.mp4 124.0 MB
4/1. Stacks bracket matching.mp4 123.3 MB
6. Greedy Algorithms/4. Timetable Problem.mp4 122.7 MB
1. Introduction/4. What is an Online Judge.mp4 122.3 MB
9. Dynamic Programming/4. Maximum One-Dimensional Range Sum.mp4 120.7 MB
10. Graphs 1 Graph Exploration/8. Labyrinth Problem Part 1 Single-Source BFS.mp4 120.3 MB
15. Strings, Tries and Trees/2. DP on Strings Edit Distance.mp4 118.8 MB
10. Graphs 1 Graph Exploration/3. Depth-First Search.mp4 115.9 MB
9. Dynamic Programming/10. Horses Problem Revisited.mp4 115.8 MB
5. Hashing/4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.mp4 115.1 MB
2. Sorting/5. QuickSort.mp4 115.1 MB
6. Greedy Algorithms/5. Interval Covering.mp4 114.9 MB
1. Introduction/6. Types of Problem in Programming Contests.mp4 112.9 MB
9. Dynamic Programming/6. Optimal Coin Change 1.mp4 111.4 MB
13. Trees/2. Shortest Paths.mp4 109.9 MB
2. Sorting/1. Introduction to Section 2 and the Horse Race Problem.mp4 108.9 MB
8. Divide and Conquer/1. Revisiting Sections 2 and 3.mp4 107.8 MB
17. Extra Interactive Problems/1. How To Approach Interactive Problems.mp4 107.7 MB
5. Hashing/5. Rabin-Karp Case Study Sliding Window Technique.mp4 106.2 MB
8. Divide and Conquer/3. The Bisection Method.mp4 104.6 MB
10. Graphs 1 Graph Exploration/4. Breadth-First Search.mp4 101.5 MB
4/5. Ordered Sets and Maps.mp4 101.4 MB
5. Hashing/3. Rabin-Karp Case Study Pattern Search.mp4 100.6 MB
4/4. Unordered (Hash) Sets and Maps in C++.mp4 100.4 MB
10. Graphs 1 Graph Exploration/6. Graph Sums DFS Application.mp4 99.7 MB
5. Hashing/6. Sliding Window Technique Subarray Sums.mp4 99.4 MB
15. Strings, Tries and Trees/3. DP on Strings Longest Palindromic Substring.mp4 96.7 MB
9. Dynamic Programming/2. Bottom-Up Fibonacci.mp4 92.5 MB
10. Graphs 1 Graph Exploration/7. Connected Components.mp4 91.1 MB
14. Union-Find Disjoint Sets/2. Speeding Up UFDS.mp4 90.1 MB
10. Graphs 1 Graph Exploration/9. Labyrinth Problem Part 2 Multi-Source BFS.mp4 90.1 MB
4/8. Custom Comparators for STL Data Structures.mp4 84.5 MB
12/1. Weighted Graphs.mp4 82.8 MB
2. Sorting/9. Bucket Sort.mp4 82.5 MB
9. Dynamic Programming/9. Prefix Sums.mp4 82.1 MB
7. Complete Search/3. Backtracking Permutations.mp4 81.0 MB
15. Strings, Tries and Trees/8. Suffix Trees Other Operations.mp4 80.6 MB
6. Greedy Algorithms/1. What are Greedy Algorithms.mp4 79.8 MB
4/7. Coordinate compression.mp4 79.8 MB
11. Graphs 2 Directed Graphs and Cycles/4. Single-Source Shortest Paths BFS.mp4 78.5 MB
3. Searching/3. QuickSelect.mp4 76.9 MB
16. Game Theory Minimax and Optimal Game Playing/4. Tic Tac Toe AI 2 Program Structure.mp4 76.2 MB
9. Dynamic Programming/8. Backtracking to Find Solutions.mp4 73.8 MB
10. Graphs 1 Graph Exploration/5. Farthest Node BFS Application.mp4 73.2 MB
3. Searching/1. Linear Search.mp4 72.2 MB
3. Searching/5. Two Pointer Technique Different Paces.mp4 71.4 MB
4/3. Hash Tables and Hash Sets Introduction.mp4 71.1 MB
3. Searching/4. Two Pointer Technique Start+End.mp4 71.0 MB
17. Extra Interactive Problems/4. Farewell and Next Steps.mp4 67.2 MB
2. Sorting/10. Bucket Sort Solution to the Football Problem.mp4 67.0 MB
5. Hashing/1. Hash Functions.mp4 63.7 MB
16. Game Theory Minimax and Optimal Game Playing/2. How to Always Win in 1-2-3.mp4 62.9 MB
13. Trees/3. Tree Diameter.mp4 62.7 MB
7. Complete Search/2. Backtracking Introduction.mp4 62.6 MB
1. Introduction/3. Course Structure.mp4 61.9 MB
14. Union-Find Disjoint Sets/5. Minimum Spanning Trees Variants.mp4 60.0 MB
7. Complete Search/6. Iterative Complete Search.mp4 58.0 MB
16. Game Theory Minimax and Optimal Game Playing/7. Tic Tac Toe AI 5 Recovering the Optimal Move.mp4 56.0 MB
15. Strings, Tries and Trees/5. Representing a Dictionary Using a Trie.mp4 54.6 MB
2. Sorting/3. Structs and Overloading Comparison Operators.mp4 53.2 MB
16. Game Theory Minimax and Optimal Game Playing/1. States and Transitions.mp4 52.8 MB
8. Divide and Conquer/3.1 bisection.mp4 50.7 MB
2. Sorting/7. Count Sort.mp4 50.5 MB
7. Complete Search/4. Backtracking Subsets.mp4 49.2 MB
4/6. Dictionaries.mp4 48.1 MB
14. Union-Find Disjoint Sets/3. UFDS VS Finding Connected Components.mp4 47.8 MB
9. Dynamic Programming/11. Horses Addendum.mp4 46.7 MB
10. Graphs 1 Graph Exploration/1. Graph Terminology.mp4 42.5 MB
13. Trees/1. What Makes Trees Special.mp4 40.1 MB
2. Sorting/2. Sorting in C++ Using Custom Comparators.mp4 40.0 MB
5. Hashing/2. Extra Handling Collisions.mp4 38.6 MB
7. Complete Search/1. Complete Search Introduction.mp4 36.2 MB
2. Sorting/6. DNA Sorting Problem.mp4 33.6 MB
2. Sorting/8. Football Problem.mp4 32.0 MB
6. Greedy Algorithms/6. Sort - Solve.mp4 30.7 MB
16. Game Theory Minimax and Optimal Game Playing/3. Tic Tac Toe AI 1 Introduction to the Project.mp4 29.9 MB
15. Strings, Tries and Trees/6. From Suffix Tries to Suffix Trees.mp4 25.7 MB
6. Greedy Algorithms/8.2 Solutions.pdf 242.2 kB
15. Strings, Tries and Trees/10.2 Solutions.pdf 167.6 kB
9. Dynamic Programming/13.2 Solutions.pdf 160.7 kB
5. Hashing/8.2 Solutions.pdf 160.0 kB
6. Greedy Algorithms/8.1 Hints.pdf 158.7 kB
8. Divide and Conquer/5.2 Solutions.pdf 156.4 kB
17. Extra Interactive Problems/3.2 Solutions.pdf 155.2 kB
2. Sorting/12.2 Solutions.pdf 148.2 kB
10. Graphs 1 Graph Exploration/11.2 Solutions.pdf 142.4 kB
13. Trees/6.2 Solutions.pdf 140.6 kB
11. Graphs 2 Directed Graphs and Cycles/6.2 Solutions.pdf 139.0 kB
16. Game Theory Minimax and Optimal Game Playing/9.2 Solutions.pdf 136.2 kB
14. Union-Find Disjoint Sets/7.2 Solutions.pdf 135.6 kB
12/7.2 Solutions.pdf 126.0 kB
1. Introduction/9.2 Solutions.pdf 119.0 kB
7. Complete Search/8.2 Solutions.pdf 118.8 kB
4/10.2 Solutions.pdf 116.4 kB
3. Searching/7.2 Solutions.pdf 112.6 kB
9. Dynamic Programming/13.1 Hints.pdf 100.2 kB
8. Divide and Conquer/5.1 Hints.pdf 99.8 kB
15. Strings, Tries and Trees/10.1 Hints.pdf 91.0 kB
2. Sorting/8.1 footballData.txt 78.9 kB
5. Hashing/8.1 Hints.pdf 75.0 kB
10. Graphs 1 Graph Exploration/11.1 Hints.pdf 74.5 kB
13. Trees/6.1 Hints.pdf 72.4 kB
11. Graphs 2 Directed Graphs and Cycles/6.1 Hints.pdf 71.4 kB
16. Game Theory Minimax and Optimal Game Playing/9.1 Hints.pdf 68.3 kB
17. Extra Interactive Problems/3.1 Hints.pdf 68.1 kB
2. Sorting/12.1 Hints.pdf 64.2 kB
1. Introduction/9.1 Hints.pdf 63.3 kB
3. Searching/7.1 Hints.pdf 61.2 kB
12/7.1 Hints.pdf 61.2 kB
14. Union-Find Disjoint Sets/7.1 Hints.pdf 60.3 kB
7. Complete Search/8.1 Hints.pdf 59.0 kB
7. Complete Search/5.1 Card_Game.pdf 58.2 kB
4/10.1 Hints.pdf 53.2 kB
2. Sorting/1.1 Horses.pdf 52.6 kB
2. Sorting/6.1 dna.txt 28.4 kB
12/2. Single-Source Shortest Paths Dijkstra.srt 24.5 kB
12/5. Case Study Arbitrages and the Logarithm Trick.srt 20.9 kB
16. Game Theory Minimax and Optimal Game Playing/6. Tic Tac Toe AI 4 Minimax.srt 20.6 kB
11. Graphs 2 Directed Graphs and Cycles/2. Topological Sort.srt 20.0 kB
9. Dynamic Programming/7. Optimal Coin Change 2.srt 19.9 kB
6. Greedy Algorithms/3. Demonstrating Correctness Under Contest Time Pressure.srt 19.1 kB
11. Graphs 2 Directed Graphs and Cycles/3. Strongly Connected Components.srt 17.8 kB
11. Graphs 2 Directed Graphs and Cycles/1. Exploring Directed Graphs.srt 17.4 kB
13. Trees/4. Minimum Spanning Trees Prim's Algorithm.srt 17.2 kB
2. Sorting/4. Merge Sort.srt 17.1 kB
3. Searching/2. Binary Search.srt 16.2 kB
15. Strings, Tries and Trees/4. Suffix Tries.srt 16.1 kB
4/2. Queues.srt 15.7 kB
15. Strings, Tries and Trees/7. Suffix Trees Insertion.srt 15.7 kB
12/4. Bellman-Ford and Negative-Weight Cycles.srt 15.6 kB
12/3. All-Pairs Shortest Paths Floyd-Warshall's.srt 15.3 kB
6. Greedy Algorithms/2. Greedy Coin Change.srt 15.1 kB
14. Union-Find Disjoint Sets/1. UFDS Introduction.srt 14.9 kB
15. Strings, Tries and Trees/1. DP on Strings Longest Common Subsequence.srt 14.4 kB
9. Dynamic Programming/5. Space Optimisation.srt 14.2 kB
2. Sorting/5. QuickSort.srt 14.2 kB
4/1. Stacks bracket matching.srt 13.8 kB
9. Dynamic Programming/1. Top-Down Fibonacci.srt 13.5 kB
16. Game Theory Minimax and Optimal Game Playing/5. Tic Tac Toe AI 3 Helper Functions.srt 13.3 kB
9. Dynamic Programming/3. How to Recognise and Approach DP Problems.srt 13.2 kB
9. Dynamic Programming/4. Maximum One-Dimensional Range Sum.srt 13.1 kB
8. Divide and Conquer/2. Binary Search the Answer.srt 13.0 kB
6. Greedy Algorithms/4. Timetable Problem.srt 12.8 kB
9. Dynamic Programming/6. Optimal Coin Change 1.srt 12.5 kB
10. Graphs 1 Graph Exploration/7. Connected Components.srt 12.5 kB
15. Strings, Tries and Trees/2. DP on Strings Edit Distance.srt 12.4 kB
10. Graphs 1 Graph Exploration/2. Graph Representation.srt 12.0 kB
10. Graphs 1 Graph Exploration/8. Labyrinth Problem Part 1 Single-Source BFS.srt 11.8 kB
14. Union-Find Disjoint Sets/4. Example Application Kruskal's Algorithm.srt 11.8 kB
4/8. Custom Comparators for STL Data Structures.srt 11.7 kB
10. Graphs 1 Graph Exploration/3. Depth-First Search.srt 11.7 kB
7. Complete Search/5. Pruning Card Game.srt 11.5 kB
4/5. Ordered Sets and Maps.srt 11.3 kB
4/4. Unordered (Hash) Sets and Maps in C++.srt 11.2 kB
5. Hashing/3. Rabin-Karp Case Study Pattern Search.srt 11.2 kB
10. Graphs 1 Graph Exploration/5.1 udemySection10FarthestNode.cpp 11.1 kB
8. Divide and Conquer/3. The Bisection Method.srt 11.1 kB
2. Sorting/1. Introduction to Section 2 and the Horse Race Problem.srt 11.1 kB
13. Trees/2. Shortest Paths.srt 10.8 kB
5. Hashing/4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.srt 10.8 kB
5. Hashing/6. Sliding Window Technique Subarray Sums.srt 10.3 kB
9. Dynamic Programming/10. Horses Problem Revisited.srt 10.2 kB
3. Searching/1. Linear Search.srt 10.2 kB
10. Graphs 1 Graph Exploration/4. Breadth-First Search.srt 10.1 kB
15. Strings, Tries and Trees/3. DP on Strings Longest Palindromic Substring.srt 10.1 kB
10. Graphs 1 Graph Exploration/6. Graph Sums DFS Application.srt 10.0 kB
5. Hashing/1. Hash Functions.srt 10.0 kB
7. Complete Search/3. Backtracking Permutations.srt 10.0 kB
5. Hashing/5. Rabin-Karp Case Study Sliding Window Technique.srt 9.9 kB
6. Greedy Algorithms/5. Interval Covering.srt 9.9 kB
3. Searching/3. QuickSelect.srt 9.4 kB
1. Introduction/1. About the Instructor.srt 9.3 kB
16. Game Theory Minimax and Optimal Game Playing/2. How to Always Win in 1-2-3.srt 8.9 kB
3. Searching/4. Two Pointer Technique Start+End.srt 8.9 kB
10. Graphs 1 Graph Exploration/9. Labyrinth Problem Part 2 Multi-Source BFS.srt 8.8 kB
11. Graphs 2 Directed Graphs and Cycles/4. Single-Source Shortest Paths BFS.srt 8.7 kB
3. Searching/5. Two Pointer Technique Different Paces.srt 8.2 kB
14. Union-Find Disjoint Sets/2. Speeding Up UFDS.srt 7.9 kB
16. Game Theory Minimax and Optimal Game Playing/4. Tic Tac Toe AI 2 Program Structure.srt 7.8 kB
1. Introduction/4. What is an Online Judge.srt 7.7 kB
1. Introduction/6. Types of Problem in Programming Contests.srt 7.4 kB
9. Dynamic Programming/9. Prefix Sums.srt 7.1 kB
8. Divide and Conquer/1. Revisiting Sections 2 and 3.srt 7.1 kB
17. Extra Interactive Problems/1. How To Approach Interactive Problems.srt 7.1 kB
9. Dynamic Programming/8. Backtracking to Find Solutions.srt 7.1 kB
9. Dynamic Programming/2. Bottom-Up Fibonacci.srt 6.9 kB
14. Union-Find Disjoint Sets/5. Minimum Spanning Trees Variants.srt 6.8 kB
2. Sorting/10. Bucket Sort Solution to the Football Problem.srt 6.6 kB
15. Strings, Tries and Trees/5. Representing a Dictionary Using a Trie.srt 6.3 kB
13. Trees/3. Tree Diameter.srt 6.1 kB
15. Strings, Tries and Trees/8. Suffix Trees Other Operations.srt 6.1 kB
16. Game Theory Minimax and Optimal Game Playing/7. Tic Tac Toe AI 5 Recovering the Optimal Move.srt 5.9 kB
7. Complete Search/4. Backtracking Subsets.srt 5.8 kB
2. Sorting/3. Structs and Overloading Comparison Operators.srt 5.8 kB
12/1. Weighted Graphs.srt 5.7 kB
4/7. Coordinate compression.srt 5.7 kB
4/6. Dictionaries.srt 5.5 kB
6. Greedy Algorithms/1. What are Greedy Algorithms.srt 5.5 kB
7. Complete Search/6. Iterative Complete Search.srt 5.5 kB
2. Sorting/7. Count Sort.srt 5.5 kB
2. Sorting/9. Bucket Sort.srt 5.4 kB
10. Graphs 1 Graph Exploration/1. Graph Terminology.srt 5.0 kB
4/3. Hash Tables and Hash Sets Introduction.srt 4.5 kB
9. Dynamic Programming/11. Horses Addendum.srt 4.4 kB
16. Game Theory Minimax and Optimal Game Playing/4.1 udemySection16TicTacToe.cpp 4.4 kB
17. Extra Interactive Problems/4. Farewell and Next Steps.srt 4.4 kB
7. Complete Search/2. Backtracking Introduction.srt 4.2 kB
1. Introduction/3. Course Structure.srt 4.2 kB
2. Sorting/2. Sorting in C++ Using Custom Comparators.srt 3.7 kB
15. Strings, Tries and Trees/7.2 udemySection15SuffixTree.cpp 3.6 kB
14. Union-Find Disjoint Sets/3. UFDS VS Finding Connected Components.srt 3.4 kB
16. Game Theory Minimax and Optimal Game Playing/1. States and Transitions.srt 3.3 kB
14. Union-Find Disjoint Sets/5.1 udemySection14MSTVariants.cpp 3.2 kB
2. Sorting/3.1 horsesOverloading.cpp 3.0 kB
2. Sorting/2.1 horsesFunction.cpp 2.9 kB
13. Trees/1. What Makes Trees Special.srt 2.9 kB
7. Complete Search/1. Complete Search Introduction.srt 2.6 kB
15. Strings, Tries and Trees/6. From Suffix Tries to Suffix Trees.srt 2.6 kB
5. Hashing/2. Extra Handling Collisions.srt 2.4 kB
6. Greedy Algorithms/6. Sort - Solve.srt 2.3 kB
2. Sorting/6. DNA Sorting Problem.srt 2.2 kB
5. Hashing/3.2 udemySection5StringSearch.cpp 2.2 kB
16. Game Theory Minimax and Optimal Game Playing/3. Tic Tac Toe AI 1 Introduction to the Project.srt 2.2 kB
2. Sorting/8. Football Problem.srt 2.0 kB
2. Sorting/10.1 footballers.cpp 1.8 kB
11. Graphs 2 Directed Graphs and Cycles/3.2 udemySection11SCCs.cpp 1.7 kB
11. Graphs 2 Directed Graphs and Cycles/2.1 udemySection11TopologicalSort.cpp 1.6 kB
1. Introduction/7. IO for Competitive Programming.html 1.6 kB
7. Complete Search/5.2 udemySection7Pruning.cpp 1.5 kB
15. Strings, Tries and Trees/3.1 udemySection15LongestPalindromicSubstring.cpp 1.5 kB
12/2.2 udemySection12Dijkstra.cpp 1.5 kB
15. Strings, Tries and Trees/5.1 udemySection15Dictionary.cpp 1.5 kB
4/6.1 udemySection4Dicts.cpp 1.5 kB
4/1.2 udemySection4Stacks.cpp 1.4 kB
12/5.1 udemySection12Arbitrages.cpp 1.4 kB
9. Dynamic Programming/8.1 udemySection9Backtracking.cpp 1.4 kB
9. Dynamic Programming/12. Problem Set 8.html 1.4 kB
15. Strings, Tries and Trees/4.1 udemySection15Trie.cpp 1.3 kB
6. Greedy Algorithms/4.2 udemySection6Timetable.cpp 1.3 kB
2. Sorting/4.1 udemySection2MergeSort.cpp 1.3 kB
4/9. Problem Set 3.html 1.3 kB
10. Graphs 1 Graph Exploration/9.1 udemySection10Labyrinth2.cpp 1.3 kB
3. Searching/3.2 udemySection3QuickSelect.cpp 1.2 kB
9. Dynamic Programming/5.1 udemySection9SpaceOptimisation.cpp 1.2 kB
14. Union-Find Disjoint Sets/4.1 udemySection14Kruskal.cpp 1.2 kB
6. Greedy Algorithms/2.1 udemySection6GreedyCoinChange.cpp 1.1 kB
4/8.1 udemySection4CustomComparators.cpp 1.1 kB
1. Introduction/5. Online Judge Verdicts.html 1.1 kB
12/4.1 udemySection12BellmanFord.cpp 1.1 kB
13. Trees/4.1 udemySection13Prim.cpp 1.1 kB
11. Graphs 2 Directed Graphs and Cycles/1.1 udemySection10ExploringDirectedGraphs.cpp 1.1 kB
6. Greedy Algorithms/7. Problem Set 5.html 1.1 kB
4/5.1 udemySection4Ordered.cpp 1.1 kB
13. Trees/3.1 udemySection13Diameter.cpp 1.1 kB
6. Greedy Algorithms/5.1 udemySection6IntervalCovering.cpp 1.1 kB
10. Graphs 1 Graph Exploration/8.1 udemySection10Labyrinth.cpp 1.1 kB
2. Sorting/11. Problem Set 1.html 1.0 kB
11. Graphs 2 Directed Graphs and Cycles/5. Problem Set 10.html 1.0 kB
10. Graphs 1 Graph Exploration/6.1 udemySection10GraphSums.cpp 1.0 kB
12/3.1 udemySection12APSP.cpp 1.0 kB
13. Trees/2.1 udemySection13ShortestPaths.cpp 991 Bytes
1. Introduction/2. Course Prerequisites.html 957 Bytes
3. Searching/5.1 udemySection3TwoPointerP2.cpp 953 Bytes
7. Complete Search/3.1 udemySection7Permutations.cpp 884 Bytes
14. Union-Find Disjoint Sets/6. Problem Set 13.html 881 Bytes
11. Graphs 2 Directed Graphs and Cycles/4.1 udemySection11SSSP.cpp 877 Bytes
15. Strings, Tries and Trees/2.1 udemySection15EditDistance.cpp 870 Bytes
8. Divide and Conquer/4. Problem Set 7.html 869 Bytes
2. Sorting/5.2 udemySection2QuickSort.cpp 868 Bytes
16. Game Theory Minimax and Optimal Game Playing/8. Problem Set 15.html 855 Bytes
14. Union-Find Disjoint Sets/2.1 udemySection14UFDSOptimised.cpp 852 Bytes
10. Graphs 1 Graph Exploration/4.1 udemySection10BFS.cpp 848 Bytes
1. Introduction/8. Welcome Contest.html 818 Bytes
17. Extra Interactive Problems/2. Problem Set 16.html 811 Bytes
7. Complete Search/6.1 udemySection7IterativeCompleteSearch.cpp 805 Bytes
9. Dynamic Programming/6.1 udemySection9CoinChange.cpp 784 Bytes
10. Graphs 1 Graph Exploration/10. Problem Set 9.html 777 Bytes
10. Graphs 1 Graph Exploration/3.1 udemySection10DFS.cpp 770 Bytes
15. Strings, Tries and Trees/9. Problem Set 14.html 761 Bytes
3. Searching/2.1 udemySection3BinarySearch.cpp 746 Bytes
7. Complete Search/7. Problem Set 6.html 732 Bytes
12/6. Problem Set 11.html 714 Bytes
3. Searching/6. Problem Set 2.html 711 Bytes
2. Sorting/7.1 dnaCountSort.cpp 706 Bytes
15. Strings, Tries and Trees/1.1 udemySection15LCS.cpp 694 Bytes
10. Graphs 1 Graph Exploration/7.1 udemySection10ConnectedComponents.cpp 692 Bytes
10. Graphs 1 Graph Exploration/6.2 udemySection10GraphSumsShort.cpp 652 Bytes
13. Trees/5. Problem Set 12.html 637 Bytes
14. Union-Find Disjoint Sets/1.1 udemySection14UFDSIntro.cpp 609 Bytes
7. Complete Search/4.1 udemySection7Subsets.cpp 583 Bytes
8. Divide and Conquer/2.1 udemySection8BinarySearchAnswer.cpp 574 Bytes
9. Dynamic Programming/4.1 udemySection9Max1DRangeSum.cpp 570 Bytes
10. Graphs 1 Graph Exploration/2.1 udemySection10StoringGraphs.cpp 569 Bytes
5. Hashing/7. Problem Set 4.html 538 Bytes
3. Searching/4.2 udemySection3TwoPointer.cpp 535 Bytes
9. Dynamic Programming/9.1 udemySection9PrefixSums.cpp 516 Bytes
5. Hashing/6.1 udemySection5SlidingWindow.cpp 501 Bytes
9. Dynamic Programming/1.1 udemySection9TopDownFibonacci.cpp 460 Bytes
9. Dynamic Programming/2.1 udemySection9BottomUpFibonacci.cpp 412 Bytes
3. Searching/1.1 udemySection3LinearSearch.cpp 337 Bytes
5. Hashing/1.1 udemySection5HashFunctions.cpp 318 Bytes
1. Introduction/9. Hints and Solutions.html 262 Bytes
4/1.1 Problem to submit code to. Note all operations described are O(1) in C++..html 152 Bytes
5. Hashing/1.2 Why Choose a Prime Cardinality.html 148 Bytes
16. Game Theory Minimax and Optimal Game Playing/3.1 This article series is a useful reference to learn about an alternative implementation and its details.html 143 Bytes
3. Searching/3.1 Extra resource.html 143 Bytes
1. Introduction/[Tutorialsplanet.NET].url 128 Bytes
17. Extra Interactive Problems/[Tutorialsplanet.NET].url 128 Bytes
[Tutorialsplanet.NET].url 128 Bytes
3. Searching/4.1 Extra examples.html 124 Bytes
4/4.1 Also, I have never seen a problem which required multimaps but here they are.html 123 Bytes
2. Sorting/5.1 Extra resource.html 120 Bytes
6. Greedy Algorithms/4.1 Extra rigorous proof technique.html 120 Bytes
15. Strings, Tries and Trees/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 118 Bytes
11. Graphs 2 Directed Graphs and Cycles/3.1 Proof.html 116 Bytes
8. Divide and Conquer/3.2 More information on accuracy.html 116 Bytes
5. Hashing/3.1 In case you want to submit your own implementation, here is an online judge which checks submissions of Rabin-Karp.html 97 Bytes
10. Graphs 1 Graph Exploration/11. Hints and Solutions.html 76 Bytes
11. Graphs 2 Directed Graphs and Cycles/6. Hints and Solutions.html 76 Bytes
12/7. Hints and Solutions.html 76 Bytes
13. Trees/6. Hints and Solutions.html 76 Bytes
14. Union-Find Disjoint Sets/7. Hints and Solutions.html 76 Bytes
15. Strings, Tries and Trees/10. Hints and Solutions.html 76 Bytes
16. Game Theory Minimax and Optimal Game Playing/9. Hints and Solutions.html 76 Bytes
17. Extra Interactive Problems/3. Hints and Solutions.html 76 Bytes
2. Sorting/12. Hints and Solutions.html 76 Bytes
3. Searching/7. Hints and Solutions.html 76 Bytes
4/10. Hints and Solutions.html 76 Bytes
5. Hashing/8. Hints and Solutions.html 76 Bytes
6. Greedy Algorithms/8. Hints and Solutions.html 76 Bytes
7. Complete Search/8. Hints and Solutions.html 76 Bytes
8. Divide and Conquer/5. Hints and Solutions.html 76 Bytes
9. Dynamic Programming/13. Hints and Solutions.html 76 Bytes
10. Graphs 1 Graph Exploration/5. Farthest Node BFS Application.srt 0 Bytes
12/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 Bytes
4/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 Bytes

==查看完整文档列表==

上一个：黑客帝国19.4 GB
下一个：Rodrigo - Concierto De Aranjuez, Fantasía Para Un Gentilhombre - Philharmonia & English Chamber Orchestra, Navarro, Yepes 165.0 MB