589689.xyz

[] Udemy - Competitive Programming

  • 收录时间:2022-04-04 10:58:39
  • 文件大小:10GB
  • 下载次数:1
  • 最近下载:2022-04-04 10:58:39
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 6. Greedy Algorithms/3. Demonstrating Correctness Under Contest Time Pressure.mp4 269MB
  2. 12/2. Single-Source Shortest Paths Dijkstra.mp4 235MB
  3. 16. Game Theory Minimax and Optimal Game Playing/6. Tic Tac Toe AI 4 Minimax.mp4 203MB
  4. 12/5. Case Study Arbitrages and the Logarithm Trick.mp4 200MB
  5. 15. Strings, Tries and Trees/7. Suffix Trees Insertion.mp4 196MB
  6. 9. Dynamic Programming/1. Top-Down Fibonacci.mp4 187MB
  7. 9. Dynamic Programming/3. How to Recognise and Approach DP Problems.mp4 185MB
  8. 13. Trees/4. Minimum Spanning Trees Prim's Algorithm.mp4 182MB
  9. 11. Graphs 2 Directed Graphs and Cycles/2. Topological Sort.mp4 180MB
  10. 9. Dynamic Programming/7. Optimal Coin Change 2.mp4 175MB
  11. 11. Graphs 2 Directed Graphs and Cycles/1. Exploring Directed Graphs.mp4 162MB
  12. 15. Strings, Tries and Trees/4. Suffix Tries.mp4 148MB
  13. 2. Sorting/4. Merge Sort.mp4 145MB
  14. 14. Union-Find Disjoint Sets/1. UFDS Introduction.mp4 143MB
  15. 12/4. Bellman-Ford and Negative-Weight Cycles.mp4 142MB
  16. 12/3. All-Pairs Shortest Paths Floyd-Warshall's.mp4 139MB
  17. 16. Game Theory Minimax and Optimal Game Playing/5. Tic Tac Toe AI 3 Helper Functions.mp4 135MB
  18. 1. Introduction/1. About the Instructor.mp4 133MB
  19. 7. Complete Search/5. Pruning Card Game.mp4 129MB
  20. 6. Greedy Algorithms/2. Greedy Coin Change.mp4 129MB
  21. 15. Strings, Tries and Trees/1. DP on Strings Longest Common Subsequence.mp4 128MB
  22. 11. Graphs 2 Directed Graphs and Cycles/3. Strongly Connected Components.mp4 125MB
  23. 4/2. Queues.mp4 125MB
  24. 10. Graphs 1 Graph Exploration/2. Graph Representation.mp4 123MB
  25. 14. Union-Find Disjoint Sets/4. Example Application Kruskal's Algorithm.mp4 123MB
  26. 8. Divide and Conquer/2. Binary Search the Answer.mp4 123MB
  27. 9. Dynamic Programming/5. Space Optimisation.mp4 118MB
  28. 3. Searching/2. Binary Search.mp4 118MB
  29. 4/1. Stacks bracket matching.mp4 118MB
  30. 6. Greedy Algorithms/4. Timetable Problem.mp4 117MB
  31. 1. Introduction/4. What is an Online Judge.mp4 117MB
  32. 9. Dynamic Programming/4. Maximum One-Dimensional Range Sum.mp4 115MB
  33. 10. Graphs 1 Graph Exploration/8. Labyrinth Problem Part 1 Single-Source BFS.mp4 115MB
  34. 15. Strings, Tries and Trees/2. DP on Strings Edit Distance.mp4 113MB
  35. 10. Graphs 1 Graph Exploration/3. Depth-First Search.mp4 111MB
  36. 9. Dynamic Programming/10. Horses Problem Revisited.mp4 110MB
  37. 5. Hashing/4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.mp4 110MB
  38. 2. Sorting/5. QuickSort.mp4 110MB
  39. 6. Greedy Algorithms/5. Interval Covering.mp4 110MB
  40. 1. Introduction/6. Types of Problem in Programming Contests.mp4 108MB
  41. 9. Dynamic Programming/6. Optimal Coin Change 1.mp4 106MB
  42. 13. Trees/2. Shortest Paths.mp4 105MB
  43. 2. Sorting/1. Introduction to Section 2 and the Horse Race Problem.mp4 104MB
  44. 8. Divide and Conquer/1. Revisiting Sections 2 and 3.mp4 103MB
  45. 17. Extra Interactive Problems/1. How To Approach Interactive Problems.mp4 103MB
  46. 5. Hashing/5. Rabin-Karp Case Study Sliding Window Technique.mp4 101MB
  47. 8. Divide and Conquer/3. The Bisection Method.mp4 100MB
  48. 10. Graphs 1 Graph Exploration/4. Breadth-First Search.mp4 97MB
  49. 4/5. Ordered Sets and Maps.mp4 97MB
  50. 5. Hashing/3. Rabin-Karp Case Study Pattern Search.mp4 96MB
  51. 4/4. Unordered (Hash) Sets and Maps in C++.mp4 96MB
  52. 10. Graphs 1 Graph Exploration/6. Graph Sums DFS Application.mp4 95MB
  53. 5. Hashing/6. Sliding Window Technique Subarray Sums.mp4 95MB
  54. 15. Strings, Tries and Trees/3. DP on Strings Longest Palindromic Substring.mp4 92MB
  55. 9. Dynamic Programming/2. Bottom-Up Fibonacci.mp4 88MB
  56. 10. Graphs 1 Graph Exploration/7. Connected Components.mp4 87MB
  57. 14. Union-Find Disjoint Sets/2. Speeding Up UFDS.mp4 86MB
  58. 10. Graphs 1 Graph Exploration/9. Labyrinth Problem Part 2 Multi-Source BFS.mp4 86MB
  59. 4/8. Custom Comparators for STL Data Structures.mp4 81MB
  60. 12/1. Weighted Graphs.mp4 79MB
  61. 2. Sorting/9. Bucket Sort.mp4 79MB
  62. 9. Dynamic Programming/9. Prefix Sums.mp4 78MB
  63. 7. Complete Search/3. Backtracking Permutations.mp4 77MB
  64. 15. Strings, Tries and Trees/8. Suffix Trees Other Operations.mp4 77MB
  65. 6. Greedy Algorithms/1. What are Greedy Algorithms.mp4 76MB
  66. 4/7. Coordinate compression.mp4 76MB
  67. 11. Graphs 2 Directed Graphs and Cycles/4. Single-Source Shortest Paths BFS.mp4 75MB
  68. 3. Searching/3. QuickSelect.mp4 73MB
  69. 16. Game Theory Minimax and Optimal Game Playing/4. Tic Tac Toe AI 2 Program Structure.mp4 73MB
  70. 9. Dynamic Programming/8. Backtracking to Find Solutions.mp4 70MB
  71. 10. Graphs 1 Graph Exploration/5. Farthest Node BFS Application.mp4 70MB
  72. 3. Searching/1. Linear Search.mp4 69MB
  73. 3. Searching/5. Two Pointer Technique Different Paces.mp4 68MB
  74. 4/3. Hash Tables and Hash Sets Introduction.mp4 68MB
  75. 3. Searching/4. Two Pointer Technique Start+End.mp4 68MB
  76. 17. Extra Interactive Problems/4. Farewell and Next Steps.mp4 64MB
  77. 2. Sorting/10. Bucket Sort Solution to the Football Problem.mp4 64MB
  78. 5. Hashing/1. Hash Functions.mp4 61MB
  79. 16. Game Theory Minimax and Optimal Game Playing/2. How to Always Win in 1-2-3.mp4 60MB
  80. 13. Trees/3. Tree Diameter.mp4 60MB
  81. 7. Complete Search/2. Backtracking Introduction.mp4 60MB
  82. 1. Introduction/3. Course Structure.mp4 59MB
  83. 14. Union-Find Disjoint Sets/5. Minimum Spanning Trees Variants.mp4 57MB
  84. 7. Complete Search/6. Iterative Complete Search.mp4 55MB
  85. 16. Game Theory Minimax and Optimal Game Playing/7. Tic Tac Toe AI 5 Recovering the Optimal Move.mp4 53MB
  86. 15. Strings, Tries and Trees/5. Representing a Dictionary Using a Trie.mp4 52MB
  87. 2. Sorting/3. Structs and Overloading Comparison Operators.mp4 51MB
  88. 16. Game Theory Minimax and Optimal Game Playing/1. States and Transitions.mp4 50MB
  89. 8. Divide and Conquer/3.1 bisection.mp4 48MB
  90. 2. Sorting/7. Count Sort.mp4 48MB
  91. 7. Complete Search/4. Backtracking Subsets.mp4 47MB
  92. 4/6. Dictionaries.mp4 46MB
  93. 14. Union-Find Disjoint Sets/3. UFDS VS Finding Connected Components.mp4 46MB
  94. 9. Dynamic Programming/11. Horses Addendum.mp4 45MB
  95. 10. Graphs 1 Graph Exploration/1. Graph Terminology.mp4 41MB
  96. 13. Trees/1. What Makes Trees Special.mp4 38MB
  97. 2. Sorting/2. Sorting in C++ Using Custom Comparators.mp4 38MB
  98. 5. Hashing/2. Extra Handling Collisions.mp4 37MB
  99. 7. Complete Search/1. Complete Search Introduction.mp4 34MB
  100. 2. Sorting/6. DNA Sorting Problem.mp4 32MB
  101. 2. Sorting/8. Football Problem.mp4 31MB
  102. 6. Greedy Algorithms/6. Sort - Solve.mp4 29MB
  103. 16. Game Theory Minimax and Optimal Game Playing/3. Tic Tac Toe AI 1 Introduction to the Project.mp4 29MB
  104. 15. Strings, Tries and Trees/6. From Suffix Tries to Suffix Trees.mp4 24MB
  105. 6. Greedy Algorithms/8.2 Solutions.pdf 237KB
  106. 15. Strings, Tries and Trees/10.2 Solutions.pdf 164KB
  107. 9. Dynamic Programming/13.2 Solutions.pdf 157KB
  108. 5. Hashing/8.2 Solutions.pdf 156KB
  109. 6. Greedy Algorithms/8.1 Hints.pdf 155KB
  110. 8. Divide and Conquer/5.2 Solutions.pdf 153KB
  111. 17. Extra Interactive Problems/3.2 Solutions.pdf 152KB
  112. 2. Sorting/12.2 Solutions.pdf 145KB
  113. 10. Graphs 1 Graph Exploration/11.2 Solutions.pdf 139KB
  114. 13. Trees/6.2 Solutions.pdf 137KB
  115. 11. Graphs 2 Directed Graphs and Cycles/6.2 Solutions.pdf 136KB
  116. 16. Game Theory Minimax and Optimal Game Playing/9.2 Solutions.pdf 133KB
  117. 14. Union-Find Disjoint Sets/7.2 Solutions.pdf 132KB
  118. 12/7.2 Solutions.pdf 123KB
  119. 1. Introduction/9.2 Solutions.pdf 116KB
  120. 7. Complete Search/8.2 Solutions.pdf 116KB
  121. 4/10.2 Solutions.pdf 114KB
  122. 3. Searching/7.2 Solutions.pdf 110KB
  123. 9. Dynamic Programming/13.1 Hints.pdf 98KB
  124. 8. Divide and Conquer/5.1 Hints.pdf 97KB
  125. 15. Strings, Tries and Trees/10.1 Hints.pdf 89KB
  126. 2. Sorting/8.1 footballData.txt 77KB
  127. 5. Hashing/8.1 Hints.pdf 73KB
  128. 10. Graphs 1 Graph Exploration/11.1 Hints.pdf 73KB
  129. 13. Trees/6.1 Hints.pdf 71KB
  130. 11. Graphs 2 Directed Graphs and Cycles/6.1 Hints.pdf 70KB
  131. 16. Game Theory Minimax and Optimal Game Playing/9.1 Hints.pdf 67KB
  132. 17. Extra Interactive Problems/3.1 Hints.pdf 67KB
  133. 2. Sorting/12.1 Hints.pdf 63KB
  134. 1. Introduction/9.1 Hints.pdf 62KB
  135. 3. Searching/7.1 Hints.pdf 60KB
  136. 12/7.1 Hints.pdf 60KB
  137. 14. Union-Find Disjoint Sets/7.1 Hints.pdf 59KB
  138. 7. Complete Search/8.1 Hints.pdf 58KB
  139. 7. Complete Search/5.1 Card_Game.pdf 57KB
  140. 4/10.1 Hints.pdf 52KB
  141. 2. Sorting/1.1 Horses.pdf 51KB
  142. 2. Sorting/6.1 dna.txt 28KB
  143. 12/2. Single-Source Shortest Paths Dijkstra.srt 24KB
  144. 12/5. Case Study Arbitrages and the Logarithm Trick.srt 20KB
  145. 16. Game Theory Minimax and Optimal Game Playing/6. Tic Tac Toe AI 4 Minimax.srt 20KB
  146. 11. Graphs 2 Directed Graphs and Cycles/2. Topological Sort.srt 20KB
  147. 9. Dynamic Programming/7. Optimal Coin Change 2.srt 19KB
  148. 6. Greedy Algorithms/3. Demonstrating Correctness Under Contest Time Pressure.srt 19KB
  149. 11. Graphs 2 Directed Graphs and Cycles/3. Strongly Connected Components.srt 17KB
  150. 11. Graphs 2 Directed Graphs and Cycles/1. Exploring Directed Graphs.srt 17KB
  151. 13. Trees/4. Minimum Spanning Trees Prim's Algorithm.srt 17KB
  152. 2. Sorting/4. Merge Sort.srt 17KB
  153. 3. Searching/2. Binary Search.srt 16KB
  154. 15. Strings, Tries and Trees/4. Suffix Tries.srt 16KB
  155. 4/2. Queues.srt 15KB
  156. 15. Strings, Tries and Trees/7. Suffix Trees Insertion.srt 15KB
  157. 12/4. Bellman-Ford and Negative-Weight Cycles.srt 15KB
  158. 12/3. All-Pairs Shortest Paths Floyd-Warshall's.srt 15KB
  159. 6. Greedy Algorithms/2. Greedy Coin Change.srt 15KB
  160. 14. Union-Find Disjoint Sets/1. UFDS Introduction.srt 15KB
  161. 15. Strings, Tries and Trees/1. DP on Strings Longest Common Subsequence.srt 14KB
  162. 9. Dynamic Programming/5. Space Optimisation.srt 14KB
  163. 2. Sorting/5. QuickSort.srt 14KB
  164. 4/1. Stacks bracket matching.srt 13KB
  165. 9. Dynamic Programming/1. Top-Down Fibonacci.srt 13KB
  166. 16. Game Theory Minimax and Optimal Game Playing/5. Tic Tac Toe AI 3 Helper Functions.srt 13KB
  167. 9. Dynamic Programming/3. How to Recognise and Approach DP Problems.srt 13KB
  168. 9. Dynamic Programming/4. Maximum One-Dimensional Range Sum.srt 13KB
  169. 8. Divide and Conquer/2. Binary Search the Answer.srt 13KB
  170. 6. Greedy Algorithms/4. Timetable Problem.srt 13KB
  171. 9. Dynamic Programming/6. Optimal Coin Change 1.srt 12KB
  172. 10. Graphs 1 Graph Exploration/7. Connected Components.srt 12KB
  173. 15. Strings, Tries and Trees/2. DP on Strings Edit Distance.srt 12KB
  174. 10. Graphs 1 Graph Exploration/2. Graph Representation.srt 12KB
  175. 10. Graphs 1 Graph Exploration/8. Labyrinth Problem Part 1 Single-Source BFS.srt 12KB
  176. 14. Union-Find Disjoint Sets/4. Example Application Kruskal's Algorithm.srt 12KB
  177. 4/8. Custom Comparators for STL Data Structures.srt 11KB
  178. 10. Graphs 1 Graph Exploration/3. Depth-First Search.srt 11KB
  179. 7. Complete Search/5. Pruning Card Game.srt 11KB
  180. 4/5. Ordered Sets and Maps.srt 11KB
  181. 4/4. Unordered (Hash) Sets and Maps in C++.srt 11KB
  182. 5. Hashing/3. Rabin-Karp Case Study Pattern Search.srt 11KB
  183. 10. Graphs 1 Graph Exploration/5.1 udemySection10FarthestNode.cpp 11KB
  184. 8. Divide and Conquer/3. The Bisection Method.srt 11KB
  185. 2. Sorting/1. Introduction to Section 2 and the Horse Race Problem.srt 11KB
  186. 13. Trees/2. Shortest Paths.srt 11KB
  187. 5. Hashing/4. Rabin-Karp Case Study Polynomial Rolling Hash Functions.srt 11KB
  188. 5. Hashing/6. Sliding Window Technique Subarray Sums.srt 10KB
  189. 9. Dynamic Programming/10. Horses Problem Revisited.srt 10KB
  190. 3. Searching/1. Linear Search.srt 10KB
  191. 10. Graphs 1 Graph Exploration/4. Breadth-First Search.srt 10KB
  192. 15. Strings, Tries and Trees/3. DP on Strings Longest Palindromic Substring.srt 10KB
  193. 10. Graphs 1 Graph Exploration/6. Graph Sums DFS Application.srt 10KB
  194. 5. Hashing/1. Hash Functions.srt 10KB
  195. 7. Complete Search/3. Backtracking Permutations.srt 10KB
  196. 5. Hashing/5. Rabin-Karp Case Study Sliding Window Technique.srt 10KB
  197. 6. Greedy Algorithms/5. Interval Covering.srt 10KB
  198. 3. Searching/3. QuickSelect.srt 9KB
  199. 1. Introduction/1. About the Instructor.srt 9KB
  200. 16. Game Theory Minimax and Optimal Game Playing/2. How to Always Win in 1-2-3.srt 9KB
  201. 3. Searching/4. Two Pointer Technique Start+End.srt 9KB
  202. 10. Graphs 1 Graph Exploration/9. Labyrinth Problem Part 2 Multi-Source BFS.srt 9KB
  203. 11. Graphs 2 Directed Graphs and Cycles/4. Single-Source Shortest Paths BFS.srt 8KB
  204. 3. Searching/5. Two Pointer Technique Different Paces.srt 8KB
  205. 14. Union-Find Disjoint Sets/2. Speeding Up UFDS.srt 8KB
  206. 16. Game Theory Minimax and Optimal Game Playing/4. Tic Tac Toe AI 2 Program Structure.srt 8KB
  207. 1. Introduction/4. What is an Online Judge.srt 8KB
  208. 1. Introduction/6. Types of Problem in Programming Contests.srt 7KB
  209. 9. Dynamic Programming/9. Prefix Sums.srt 7KB
  210. 8. Divide and Conquer/1. Revisiting Sections 2 and 3.srt 7KB
  211. 17. Extra Interactive Problems/1. How To Approach Interactive Problems.srt 7KB
  212. 9. Dynamic Programming/8. Backtracking to Find Solutions.srt 7KB
  213. 9. Dynamic Programming/2. Bottom-Up Fibonacci.srt 7KB
  214. 14. Union-Find Disjoint Sets/5. Minimum Spanning Trees Variants.srt 7KB
  215. 2. Sorting/10. Bucket Sort Solution to the Football Problem.srt 6KB
  216. 15. Strings, Tries and Trees/5. Representing a Dictionary Using a Trie.srt 6KB
  217. 13. Trees/3. Tree Diameter.srt 6KB
  218. 15. Strings, Tries and Trees/8. Suffix Trees Other Operations.srt 6KB
  219. 16. Game Theory Minimax and Optimal Game Playing/7. Tic Tac Toe AI 5 Recovering the Optimal Move.srt 6KB
  220. 7. Complete Search/4. Backtracking Subsets.srt 6KB
  221. 2. Sorting/3. Structs and Overloading Comparison Operators.srt 6KB
  222. 12/1. Weighted Graphs.srt 6KB
  223. 4/7. Coordinate compression.srt 6KB
  224. 4/6. Dictionaries.srt 5KB
  225. 6. Greedy Algorithms/1. What are Greedy Algorithms.srt 5KB
  226. 7. Complete Search/6. Iterative Complete Search.srt 5KB
  227. 2. Sorting/7. Count Sort.srt 5KB
  228. 2. Sorting/9. Bucket Sort.srt 5KB
  229. 10. Graphs 1 Graph Exploration/1. Graph Terminology.srt 5KB
  230. 4/3. Hash Tables and Hash Sets Introduction.srt 4KB
  231. 9. Dynamic Programming/11. Horses Addendum.srt 4KB
  232. 16. Game Theory Minimax and Optimal Game Playing/4.1 udemySection16TicTacToe.cpp 4KB
  233. 17. Extra Interactive Problems/4. Farewell and Next Steps.srt 4KB
  234. 7. Complete Search/2. Backtracking Introduction.srt 4KB
  235. 1. Introduction/3. Course Structure.srt 4KB
  236. 2. Sorting/2. Sorting in C++ Using Custom Comparators.srt 4KB
  237. 15. Strings, Tries and Trees/7.2 udemySection15SuffixTree.cpp 4KB
  238. 14. Union-Find Disjoint Sets/3. UFDS VS Finding Connected Components.srt 3KB
  239. 16. Game Theory Minimax and Optimal Game Playing/1. States and Transitions.srt 3KB
  240. 14. Union-Find Disjoint Sets/5.1 udemySection14MSTVariants.cpp 3KB
  241. 2. Sorting/3.1 horsesOverloading.cpp 3KB
  242. 2. Sorting/2.1 horsesFunction.cpp 3KB
  243. 13. Trees/1. What Makes Trees Special.srt 3KB
  244. 7. Complete Search/1. Complete Search Introduction.srt 3KB
  245. 15. Strings, Tries and Trees/6. From Suffix Tries to Suffix Trees.srt 3KB
  246. 5. Hashing/2. Extra Handling Collisions.srt 2KB
  247. 6. Greedy Algorithms/6. Sort - Solve.srt 2KB
  248. 2. Sorting/6. DNA Sorting Problem.srt 2KB
  249. 5. Hashing/3.2 udemySection5StringSearch.cpp 2KB
  250. 16. Game Theory Minimax and Optimal Game Playing/3. Tic Tac Toe AI 1 Introduction to the Project.srt 2KB
  251. 2. Sorting/8. Football Problem.srt 2KB
  252. 2. Sorting/10.1 footballers.cpp 2KB
  253. 11. Graphs 2 Directed Graphs and Cycles/3.2 udemySection11SCCs.cpp 2KB
  254. 11. Graphs 2 Directed Graphs and Cycles/2.1 udemySection11TopologicalSort.cpp 2KB
  255. 1. Introduction/7. IO for Competitive Programming.html 2KB
  256. 7. Complete Search/5.2 udemySection7Pruning.cpp 1KB
  257. 15. Strings, Tries and Trees/3.1 udemySection15LongestPalindromicSubstring.cpp 1KB
  258. 12/2.2 udemySection12Dijkstra.cpp 1KB
  259. 15. Strings, Tries and Trees/5.1 udemySection15Dictionary.cpp 1KB
  260. 4/6.1 udemySection4Dicts.cpp 1KB
  261. 4/1.2 udemySection4Stacks.cpp 1KB
  262. 12/5.1 udemySection12Arbitrages.cpp 1KB
  263. 9. Dynamic Programming/8.1 udemySection9Backtracking.cpp 1KB
  264. 9. Dynamic Programming/12. Problem Set 8.html 1KB
  265. 15. Strings, Tries and Trees/4.1 udemySection15Trie.cpp 1KB
  266. 6. Greedy Algorithms/4.2 udemySection6Timetable.cpp 1KB
  267. 2. Sorting/4.1 udemySection2MergeSort.cpp 1KB
  268. 4/9. Problem Set 3.html 1KB
  269. 10. Graphs 1 Graph Exploration/9.1 udemySection10Labyrinth2.cpp 1KB
  270. 3. Searching/3.2 udemySection3QuickSelect.cpp 1KB
  271. 9. Dynamic Programming/5.1 udemySection9SpaceOptimisation.cpp 1KB
  272. 14. Union-Find Disjoint Sets/4.1 udemySection14Kruskal.cpp 1KB
  273. 6. Greedy Algorithms/2.1 udemySection6GreedyCoinChange.cpp 1KB
  274. 4/8.1 udemySection4CustomComparators.cpp 1KB
  275. 1. Introduction/5. Online Judge Verdicts.html 1KB
  276. 12/4.1 udemySection12BellmanFord.cpp 1KB
  277. 13. Trees/4.1 udemySection13Prim.cpp 1KB
  278. 11. Graphs 2 Directed Graphs and Cycles/1.1 udemySection10ExploringDirectedGraphs.cpp 1KB
  279. 6. Greedy Algorithms/7. Problem Set 5.html 1KB
  280. 4/5.1 udemySection4Ordered.cpp 1KB
  281. 13. Trees/3.1 udemySection13Diameter.cpp 1KB
  282. 6. Greedy Algorithms/5.1 udemySection6IntervalCovering.cpp 1KB
  283. 10. Graphs 1 Graph Exploration/8.1 udemySection10Labyrinth.cpp 1KB
  284. 2. Sorting/11. Problem Set 1.html 1KB
  285. 11. Graphs 2 Directed Graphs and Cycles/5. Problem Set 10.html 1KB
  286. 10. Graphs 1 Graph Exploration/6.1 udemySection10GraphSums.cpp 1KB
  287. 12/3.1 udemySection12APSP.cpp 1019B
  288. 13. Trees/2.1 udemySection13ShortestPaths.cpp 991B
  289. 1. Introduction/2. Course Prerequisites.html 957B
  290. 3. Searching/5.1 udemySection3TwoPointerP2.cpp 953B
  291. 7. Complete Search/3.1 udemySection7Permutations.cpp 884B
  292. 14. Union-Find Disjoint Sets/6. Problem Set 13.html 881B
  293. 11. Graphs 2 Directed Graphs and Cycles/4.1 udemySection11SSSP.cpp 877B
  294. 15. Strings, Tries and Trees/2.1 udemySection15EditDistance.cpp 870B
  295. 8. Divide and Conquer/4. Problem Set 7.html 869B
  296. 2. Sorting/5.2 udemySection2QuickSort.cpp 868B
  297. 16. Game Theory Minimax and Optimal Game Playing/8. Problem Set 15.html 855B
  298. 14. Union-Find Disjoint Sets/2.1 udemySection14UFDSOptimised.cpp 852B
  299. 10. Graphs 1 Graph Exploration/4.1 udemySection10BFS.cpp 848B
  300. 1. Introduction/8. Welcome Contest.html 818B
  301. 17. Extra Interactive Problems/2. Problem Set 16.html 811B
  302. 7. Complete Search/6.1 udemySection7IterativeCompleteSearch.cpp 805B
  303. 9. Dynamic Programming/6.1 udemySection9CoinChange.cpp 784B
  304. 10. Graphs 1 Graph Exploration/10. Problem Set 9.html 777B
  305. 10. Graphs 1 Graph Exploration/3.1 udemySection10DFS.cpp 770B
  306. 15. Strings, Tries and Trees/9. Problem Set 14.html 761B
  307. 3. Searching/2.1 udemySection3BinarySearch.cpp 746B
  308. 7. Complete Search/7. Problem Set 6.html 732B
  309. 12/6. Problem Set 11.html 714B
  310. 3. Searching/6. Problem Set 2.html 711B
  311. 2. Sorting/7.1 dnaCountSort.cpp 706B
  312. 15. Strings, Tries and Trees/1.1 udemySection15LCS.cpp 694B
  313. 10. Graphs 1 Graph Exploration/7.1 udemySection10ConnectedComponents.cpp 692B
  314. 10. Graphs 1 Graph Exploration/6.2 udemySection10GraphSumsShort.cpp 652B
  315. 13. Trees/5. Problem Set 12.html 637B
  316. 14. Union-Find Disjoint Sets/1.1 udemySection14UFDSIntro.cpp 609B
  317. 7. Complete Search/4.1 udemySection7Subsets.cpp 583B
  318. 8. Divide and Conquer/2.1 udemySection8BinarySearchAnswer.cpp 574B
  319. 9. Dynamic Programming/4.1 udemySection9Max1DRangeSum.cpp 570B
  320. 10. Graphs 1 Graph Exploration/2.1 udemySection10StoringGraphs.cpp 569B
  321. 5. Hashing/7. Problem Set 4.html 538B
  322. 3. Searching/4.2 udemySection3TwoPointer.cpp 535B
  323. 9. Dynamic Programming/9.1 udemySection9PrefixSums.cpp 516B
  324. 5. Hashing/6.1 udemySection5SlidingWindow.cpp 501B
  325. 9. Dynamic Programming/1.1 udemySection9TopDownFibonacci.cpp 460B
  326. 9. Dynamic Programming/2.1 udemySection9BottomUpFibonacci.cpp 412B
  327. 3. Searching/1.1 udemySection3LinearSearch.cpp 337B
  328. 5. Hashing/1.1 udemySection5HashFunctions.cpp 318B
  329. 1. Introduction/9. Hints and Solutions.html 262B
  330. 4/1.1 Problem to submit code to. Note all operations described are O(1) in C++..html 152B
  331. 5. Hashing/1.2 Why Choose a Prime Cardinality.html 148B
  332. 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 143B
  333. 3. Searching/3.1 Extra resource.html 143B
  334. 1. Introduction/[Tutorialsplanet.NET].url 128B
  335. 17. Extra Interactive Problems/[Tutorialsplanet.NET].url 128B
  336. [Tutorialsplanet.NET].url 128B
  337. 3. Searching/4.1 Extra examples.html 124B
  338. 4/4.1 Also, I have never seen a problem which required multimaps but here they are.html 123B
  339. 2. Sorting/5.1 Extra resource.html 120B
  340. 6. Greedy Algorithms/4.1 Extra rigorous proof technique.html 120B
  341. 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 118B
  342. 11. Graphs 2 Directed Graphs and Cycles/3.1 Proof.html 116B
  343. 8. Divide and Conquer/3.2 More information on accuracy.html 116B
  344. 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 97B
  345. 10. Graphs 1 Graph Exploration/11. Hints and Solutions.html 76B
  346. 11. Graphs 2 Directed Graphs and Cycles/6. Hints and Solutions.html 76B
  347. 12/7. Hints and Solutions.html 76B
  348. 13. Trees/6. Hints and Solutions.html 76B
  349. 14. Union-Find Disjoint Sets/7. Hints and Solutions.html 76B
  350. 15. Strings, Tries and Trees/10. Hints and Solutions.html 76B
  351. 16. Game Theory Minimax and Optimal Game Playing/9. Hints and Solutions.html 76B
  352. 17. Extra Interactive Problems/3. Hints and Solutions.html 76B
  353. 2. Sorting/12. Hints and Solutions.html 76B
  354. 3. Searching/7. Hints and Solutions.html 76B
  355. 4/10. Hints and Solutions.html 76B
  356. 5. Hashing/8. Hints and Solutions.html 76B
  357. 6. Greedy Algorithms/8. Hints and Solutions.html 76B
  358. 7. Complete Search/8. Hints and Solutions.html 76B
  359. 8. Divide and Conquer/5. Hints and Solutions.html 76B
  360. 9. Dynamic Programming/13. Hints and Solutions.html 76B
  361. 10. Graphs 1 Graph Exploration/5. Farthest Node BFS Application.srt 0B
  362. 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 0B
  363. 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 0B