589689.xyz

[Udemy] Рекурсия, Бэктрекинг и Динамическое программирование в Java (2020) [En]

  • 收录时间:2021-07-04 09:19:38
  • 文件大小:3GB
  • 下载次数:1
  • 最近下载:2021-07-04 09:19:38
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 08 Divide and Conquer Methods/089 Closest pair of points implementation.mp4 198MB
  2. 05 Backtracking/054 Knight's tour implementation I.mp4 91MB
  3. 09 Common Interview Questions/097 Two eggs problem solution II.mp4 88MB
  4. 06 Dynamic Programming/077 Subset sum problem implementation.mp4 87MB
  5. 02 Recursion/015 Towers of Hanoi problem introduction.mp4 82MB
  6. 06 Dynamic Programming/068 Knapsack problem implementation I.mp4 80MB
  7. 05 Backtracking/060 Sudoku implementation I.mp4 77MB
  8. 05 Backtracking/041 N-queens problem implementation I.mp4 76MB
  9. 08 Divide and Conquer Methods/087 Closest pair of points problem introduction I.mp4 75MB
  10. 06 Dynamic Programming/066 Knapsack problem introduction.mp4 72MB
  11. 08 Divide and Conquer Methods/084 Merge sort implementation.mp4 70MB
  12. 05 Backtracking/047 Hamiltonian cycle implementation I.mp4 60MB
  13. 05 Backtracking/049 Coloring problem introduction.mp4 58MB
  14. 04 Selection Algorithms/030 Quickselect implementation.mp4 52MB
  15. 02 Recursion/004 Recursion introduction.mp4 50MB
  16. 04 Selection Algorithms/027 Selection algorithms introduction.mp4 48MB
  17. 06 Dynamic Programming/069 Knapsack problem implementation II.mp4 47MB
  18. 04 Selection Algorithms/034 Advanced selection - median of medians algorithm.mp4 46MB
  19. 06 Dynamic Programming/067 Knapsack problem example.mp4 44MB
  20. 05 Backtracking/048 Hamiltonian cycle implementation II.mp4 44MB
  21. 05 Backtracking/051 Coloring problem implementation I.mp4 42MB
  22. 06 Dynamic Programming/065 Fibonacci numbers implementation.mp4 42MB
  23. 07 Optimal Packing Problem/079 Bin packing problem implementation.mp4 41MB
  24. 05 Backtracking/057 Maze problem implementation I.mp4 41MB
  25. 06 Dynamic Programming/074 Rod cutting problem implementation.mp4 40MB
  26. 06 Dynamic Programming/073 Rod cutting problem example.mp4 39MB
  27. 06 Dynamic Programming/063 Dynamic programming introduction.mp4 39MB
  28. 09 Common Interview Questions/092 Palindrome problem solution.mp4 36MB
  29. 06 Dynamic Programming/075 Subset sum problem introduction.mp4 36MB
  30. 09 Common Interview Questions/103 Largest sum subarray problem solution.mp4 34MB
  31. 05 Backtracking/062 What is the issue with NP-complete problems_.mp4 34MB
  32. 05 Backtracking/042 N-queens problem implementation II.mp4 33MB
  33. 05 Backtracking/052 Coloring problem implementation II.mp4 33MB
  34. 09 Common Interview Questions/096 Two eggs problem solution I.mp4 32MB
  35. 06 Dynamic Programming/072 Rod cutting problem introduction.mp4 30MB
  36. 05 Backtracking/055 Knight's tour implementation II.mp4 28MB
  37. 08 Divide and Conquer Methods/081 What are divide-and-conquer approaches_.mp4 28MB
  38. 03 Search Algorithms/026 Binary search implementation.mp4 27MB
  39. 02 Recursion/006 Recursion and stack memory (stack overflow).mp4 27MB
  40. 05 Backtracking/058 Maze problem implementation II.mp4 26MB
  41. 06 Dynamic Programming/076 Subset sum problem example.mp4 25MB
  42. 08 Divide and Conquer Methods/088 Closes pair of points problem introduction II.mp4 25MB
  43. 04 Selection Algorithms/028 Quickselect introduction - Hoare algorithm.mp4 24MB
  44. 04 Selection Algorithms/036 Online selection - the secretary problem.mp4 24MB
  45. 05 Backtracking/061 Sudoku implementation II.mp4 23MB
  46. 02 Recursion/005 Adding numbers_ iteration vs recursion.mp4 23MB
  47. 09 Common Interview Questions/099 Duplicates in an array problem solution.mp4 23MB
  48. 04 Selection Algorithms/029 Quickselect visualization.mp4 22MB
  49. 02 Recursion/016 Tower of Hanoi problem implementation.mp4 22MB
  50. 02 Recursion/009 Factorial function - head recursion.mp4 22MB
  51. 02 Recursion/008 Head recursion and tail recursion implementation.mp4 21MB
  52. 02 Recursion/017 Towers of Hanoi - visualizing the stack.mp4 21MB
  53. 05 Backtracking/045 Hamiltonian paths (and cycles) introduction.mp4 20MB
  54. 08 Divide and Conquer Methods/083 Merge sort theory.mp4 20MB
  55. 05 Backtracking/043 N-queens problem and stack memory visualization.mp4 19MB
  56. 07 Optimal Packing Problem/078 Bin packing problem introduction.mp4 19MB
  57. 09 Common Interview Questions/094 Integer reversion solution.mp4 19MB
  58. 04 Selection Algorithms/033 What the problem with pivots_.mp4 19MB
  59. 02 Recursion/011 Factorial function - tail recursion.mp4 17MB
  60. 05 Backtracking/059 Sudoku introduction.mp4 17MB
  61. 02 Recursion/003 Stack memory and heap memory simulation.mp4 17MB
  62. 05 Backtracking/039 N-queens problem introduction.mp4 16MB
  63. 02 Recursion/012 Fibonacci numbers - head recursion.mp4 16MB
  64. 05 Backtracking/037 Backtracking introduction.mp4 15MB
  65. 10 Course Materials (DOWNLOADS)/104 AlgorithmicJava.zip 15MB
  66. 09 Common Interview Questions/101 Anagram problem solution.mp4 13MB
  67. 06 Dynamic Programming/064 Fibonacci numbers introduction.mp4 13MB
  68. 03 Search Algorithms/025 What is binary (logarithmic) search_.mp4 12MB
  69. 05 Backtracking/046 Hamiltonian cycle illustration.mp4 10MB
  70. 05 Backtracking/056 Maze problem introduction.mp4 10MB
  71. 02 Recursion/002 What are stack and heap memory_.mp4 9MB
  72. 05 Backtracking/038 Brute-force search and backtracking.mp4 9MB
  73. 02 Recursion/010 Factorial problem - visualizing the stack.mp4 9MB
  74. 05 Backtracking/050 Coloring problem visualization.mp4 8MB
  75. 03 Search Algorithms/022 Linear search implementation.mp4 8MB
  76. 05 Backtracking/053 Knight's tour introduction.mp4 8MB
  77. 01 Introduction/001 Introduction.mp4 8MB
  78. 11 Algorhyme FREE Algorithms Visualizer App/105 What is Algorhyme_.mp4 7MB
  79. 08 Divide and Conquer Methods/082 Binary search revisited.mp4 7MB
  80. 05 Backtracking/040 What is the search tree_.mp4 6MB
  81. 03 Search Algorithms/021 What is linear search_.mp4 5MB
  82. 04 Selection Algorithms/035 Combining algorithms - introselect algorithm.mp4 5MB
  83. 02 Recursion/020 Iteration and recursion revisited.mp4 4MB
  84. 08 Divide and Conquer Methods/089 Closest pair of points implementation.en.srt 32KB
  85. 06 Dynamic Programming/066 Knapsack problem introduction.en.srt 26KB
  86. 08 Divide and Conquer Methods/087 Closest pair of points problem introduction I.en.srt 22KB
  87. 06 Dynamic Programming/067 Knapsack problem example.en.srt 19KB
  88. 06 Dynamic Programming/073 Rod cutting problem example.en.srt 17KB
  89. 09 Common Interview Questions/097 Two eggs problem solution II.en.srt 16KB
  90. 04 Selection Algorithms/030 Quickselect implementation.en.srt 15KB
  91. 06 Dynamic Programming/075 Subset sum problem introduction.en.srt 14KB
  92. 02 Recursion/006 Recursion and stack memory (stack overflow).en.srt 14KB
  93. 06 Dynamic Programming/076 Subset sum problem example.en.srt 14KB
  94. 04 Selection Algorithms/028 Quickselect introduction - Hoare algorithm.en.srt 14KB
  95. 09 Common Interview Questions/103 Largest sum subarray problem solution.en.srt 14KB
  96. 08 Divide and Conquer Methods/081 What are divide-and-conquer approaches_.en.srt 13KB
  97. 05 Backtracking/047 Hamiltonian cycle implementation I.en.srt 13KB
  98. 04 Selection Algorithms/029 Quickselect visualization.en.srt 13KB
  99. 05 Backtracking/054 Knight's tour implementation I.en.srt 13KB
  100. 06 Dynamic Programming/074 Rod cutting problem implementation.en.srt 13KB
  101. 05 Backtracking/039 N-queens problem introduction.en.srt 13KB
  102. 05 Backtracking/049 Coloring problem introduction.en.srt 12KB
  103. 08 Divide and Conquer Methods/083 Merge sort theory.en.srt 12KB
  104. 05 Backtracking/041 N-queens problem implementation I.en.srt 12KB
  105. 07 Optimal Packing Problem/078 Bin packing problem introduction.en.srt 12KB
  106. 03 Search Algorithms/026 Binary search implementation.en.srt 12KB
  107. 06 Dynamic Programming/063 Dynamic programming introduction.en.srt 12KB
  108. 06 Dynamic Programming/072 Rod cutting problem introduction.en.srt 12KB
  109. 06 Dynamic Programming/065 Fibonacci numbers implementation.en.srt 12KB
  110. 04 Selection Algorithms/036 Online selection - the secretary problem.en.srt 12KB
  111. 02 Recursion/004 Recursion introduction.en.srt 11KB
  112. 09 Common Interview Questions/092 Palindrome problem solution.en.srt 11KB
  113. 09 Common Interview Questions/096 Two eggs problem solution I.en.srt 11KB
  114. 04 Selection Algorithms/034 Advanced selection - median of medians algorithm.en.srt 11KB
  115. 05 Backtracking/060 Sudoku implementation I.en.srt 11KB
  116. 05 Backtracking/045 Hamiltonian paths (and cycles) introduction.en.srt 11KB
  117. 09 Common Interview Questions/099 Duplicates in an array problem solution.en.srt 10KB
  118. 06 Dynamic Programming/077 Subset sum problem implementation.en.srt 10KB
  119. 02 Recursion/017 Towers of Hanoi - visualizing the stack.en.srt 10KB
  120. 05 Backtracking/043 N-queens problem and stack memory visualization.en.srt 10KB
  121. 04 Selection Algorithms/027 Selection algorithms introduction.en.srt 10KB
  122. 09 Common Interview Questions/094 Integer reversion solution.en.srt 9KB
  123. 06 Dynamic Programming/068 Knapsack problem implementation I.en.srt 9KB
  124. 07 Optimal Packing Problem/079 Bin packing problem implementation.en.srt 9KB
  125. 08 Divide and Conquer Methods/084 Merge sort implementation.en.srt 9KB
  126. 05 Backtracking/048 Hamiltonian cycle implementation II.en.srt 9KB
  127. 05 Backtracking/051 Coloring problem implementation I.en.srt 9KB
  128. 04 Selection Algorithms/033 What the problem with pivots_.en.srt 9KB
  129. 05 Backtracking/057 Maze problem implementation I.en.srt 9KB
  130. 05 Backtracking/058 Maze problem implementation II.en.srt 9KB
  131. 05 Backtracking/037 Backtracking introduction.en.srt 9KB
  132. 02 Recursion/015 Towers of Hanoi problem introduction.en.srt 8KB
  133. 02 Recursion/003 Stack memory and heap memory simulation.en.srt 8KB
  134. 05 Backtracking/042 N-queens problem implementation II.en.srt 8KB
  135. 02 Recursion/008 Head recursion and tail recursion implementation.en.srt 8KB
  136. 02 Recursion/009 Factorial function - head recursion.en.srt 8KB
  137. 05 Backtracking/059 Sudoku introduction.en.srt 8KB
  138. 02 Recursion/011 Factorial function - tail recursion.en.srt 8KB
  139. 05 Backtracking/062 What is the issue with NP-complete problems_.en.srt 8KB
  140. 05 Backtracking/056 Maze problem introduction.en.srt 8KB
  141. 02 Recursion/016 Tower of Hanoi problem implementation.en.srt 7KB
  142. 05 Backtracking/052 Coloring problem implementation II.en.srt 7KB
  143. 05 Backtracking/050 Coloring problem visualization.en.srt 7KB
  144. 05 Backtracking/055 Knight's tour implementation II.en.srt 6KB
  145. 02 Recursion/010 Factorial problem - visualizing the stack.en.srt 6KB
  146. 02 Recursion/012 Fibonacci numbers - head recursion.en.srt 6KB
  147. 05 Backtracking/046 Hamiltonian cycle illustration.en.srt 6KB
  148. 02 Recursion/005 Adding numbers_ iteration vs recursion.en.srt 6KB
  149. 08 Divide and Conquer Methods/088 Closes pair of points problem introduction II.en.srt 6KB
  150. 05 Backtracking/038 Brute-force search and backtracking.en.srt 6KB
  151. 06 Dynamic Programming/064 Fibonacci numbers introduction.en.srt 6KB
  152. 06 Dynamic Programming/069 Knapsack problem implementation II.en.srt 5KB
  153. 03 Search Algorithms/025 What is binary (logarithmic) search_.en.srt 5KB
  154. 02 Recursion/002 What are stack and heap memory_.en.srt 5KB
  155. 09 Common Interview Questions/101 Anagram problem solution.en.srt 5KB
  156. 05 Backtracking/053 Knight's tour introduction.en.srt 5KB
  157. 05 Backtracking/040 What is the search tree_.en.srt 5KB
  158. 05 Backtracking/061 Sudoku implementation II.en.srt 4KB
  159. 03 Search Algorithms/022 Linear search implementation.en.srt 4KB
  160. 01 Introduction/001 Introduction.en.srt 3KB
  161. 11 Algorhyme FREE Algorithms Visualizer App/106 Algorhyme - Algorithms and Data Structures.html 3KB
  162. 08 Divide and Conquer Methods/082 Binary search revisited.en.srt 3KB
  163. 04 Selection Algorithms/032 Solution - sorting with selection.html 3KB
  164. 02 Recursion/007 Recursion optimization in Java.html 2KB
  165. 03 Search Algorithms/021 What is linear search_.en.srt 2KB
  166. 05 Backtracking/044 How to earn $1 million with N-queens problem_.html 2KB
  167. 06 Dynamic Programming/070 Exercise - recursive implementation.html 2KB
  168. 02 Recursion/020 Iteration and recursion revisited.en.srt 2KB
  169. 04 Selection Algorithms/035 Combining algorithms - introselect algorithm.en.srt 2KB
  170. 08 Divide and Conquer Methods/086 Solution - sort the items in descending order.html 2KB
  171. 02 Recursion/014 Solution - Fibonacci-numbers with tail recursion.html 2KB
  172. 08 Divide and Conquer Methods/090 Closes pair of points - useful article.html 2KB
  173. 06 Dynamic Programming/071 Solution - recursive implementation.html 1KB
  174. 02 Recursion/013 Exercise - Fibonacci-numbers with tail recursion.html 1KB
  175. 09 Common Interview Questions/095 The two eggs problem overview.html 1KB
  176. 03 Search Algorithms/024 Solution - linear search with recursion.html 1KB
  177. 07 Optimal Packing Problem/080 Bin packing problem - useful article.html 1KB
  178. 09 Common Interview Questions/098 Duplicates in an array problem overview.html 1KB
  179. 09 Common Interview Questions/091 Palindrome problem overview.html 1KB
  180. 04 Selection Algorithms/031 Exercise - sorting with selection.html 1KB
  181. 02 Recursion/018 Exercise - solving recursion with iteration.html 1KB
  182. 02 Recursion/019 Solution - solving recursion with iteration.html 1KB
  183. 08 Divide and Conquer Methods/085 Exercise - sort the items in descending order.html 1KB
  184. 03 Search Algorithms/023 Exercise - linear search with recursion.html 1KB
  185. 09 Common Interview Questions/093 Integer reversion problem overview.html 1KB
  186. 09 Common Interview Questions/102 Largest sum subarray problem overview.html 1KB
  187. 09 Common Interview Questions/100 Anagram problem overview.html 1KB
  188. 10 Course Materials (DOWNLOADS)/104 Course materials.html 962B
  189. 11 Algorhyme FREE Algorithms Visualizer App/105 What is Algorhyme_.en.vtt 8B
  190. udemy-dl.log 0B