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

Creation Time	Oct. 4, 2024, 6:15 p.m.
Last Access Time	Oct. 12, 2025, 3:55 a.m.
File Size	2.7 GB
Keywords	En Java Udemy Динамическое в 2020 программирование и Рекурсия Бэктрекинг
Total Requests	123
Total Files	190
Magnet Link	Please wait ...
	Download (Magnet Link) Play (Watch Online)

08 Divide and Conquer Methods/089 Closest pair of points implementation.mp4 198.0 MB
05 Backtracking/054 Knight's tour implementation I.mp4 91.1 MB
09 Common Interview Questions/097 Two eggs problem solution II.mp4 88.4 MB
06 Dynamic Programming/077 Subset sum problem implementation.mp4 87.2 MB
02 Recursion/015 Towers of Hanoi problem introduction.mp4 82.5 MB
06 Dynamic Programming/068 Knapsack problem implementation I.mp4 79.8 MB
05 Backtracking/060 Sudoku implementation I.mp4 77.2 MB
05 Backtracking/041 N-queens problem implementation I.mp4 75.6 MB
08 Divide and Conquer Methods/087 Closest pair of points problem introduction I.mp4 74.8 MB
06 Dynamic Programming/066 Knapsack problem introduction.mp4 72.2 MB
08 Divide and Conquer Methods/084 Merge sort implementation.mp4 69.9 MB
05 Backtracking/047 Hamiltonian cycle implementation I.mp4 60.0 MB
05 Backtracking/049 Coloring problem introduction.mp4 58.5 MB
04 Selection Algorithms/030 Quickselect implementation.mp4 51.7 MB
02 Recursion/004 Recursion introduction.mp4 49.9 MB
04 Selection Algorithms/027 Selection algorithms introduction.mp4 48.1 MB
06 Dynamic Programming/069 Knapsack problem implementation II.mp4 46.8 MB
04 Selection Algorithms/034 Advanced selection - median of medians algorithm.mp4 45.6 MB
06 Dynamic Programming/067 Knapsack problem example.mp4 43.8 MB
05 Backtracking/048 Hamiltonian cycle implementation II.mp4 43.6 MB
05 Backtracking/051 Coloring problem implementation I.mp4 42.1 MB
06 Dynamic Programming/065 Fibonacci numbers implementation.mp4 41.9 MB
07 Optimal Packing Problem/079 Bin packing problem implementation.mp4 41.0 MB
05 Backtracking/057 Maze problem implementation I.mp4 40.6 MB
06 Dynamic Programming/074 Rod cutting problem implementation.mp4 39.5 MB
06 Dynamic Programming/073 Rod cutting problem example.mp4 39.3 MB
06 Dynamic Programming/063 Dynamic programming introduction.mp4 39.1 MB
09 Common Interview Questions/092 Palindrome problem solution.mp4 35.7 MB
06 Dynamic Programming/075 Subset sum problem introduction.mp4 35.6 MB
09 Common Interview Questions/103 Largest sum subarray problem solution.mp4 34.3 MB
05 Backtracking/062 What is the issue with NP-complete problems_.mp4 33.9 MB
05 Backtracking/042 N-queens problem implementation II.mp4 33.4 MB
05 Backtracking/052 Coloring problem implementation II.mp4 32.9 MB
09 Common Interview Questions/096 Two eggs problem solution I.mp4 31.7 MB
06 Dynamic Programming/072 Rod cutting problem introduction.mp4 29.6 MB
05 Backtracking/055 Knight's tour implementation II.mp4 28.3 MB
08 Divide and Conquer Methods/081 What are divide-and-conquer approaches_.mp4 28.0 MB
03 Search Algorithms/026 Binary search implementation.mp4 27.0 MB
02 Recursion/006 Recursion and stack memory (stack overflow).mp4 26.6 MB
05 Backtracking/058 Maze problem implementation II.mp4 25.5 MB
06 Dynamic Programming/076 Subset sum problem example.mp4 25.0 MB
08 Divide and Conquer Methods/088 Closes pair of points problem introduction II.mp4 24.6 MB
04 Selection Algorithms/028 Quickselect introduction - Hoare algorithm.mp4 24.4 MB
04 Selection Algorithms/036 Online selection - the secretary problem.mp4 23.7 MB
05 Backtracking/061 Sudoku implementation II.mp4 23.3 MB
02 Recursion/005 Adding numbers_ iteration vs recursion.mp4 23.0 MB
09 Common Interview Questions/099 Duplicates in an array problem solution.mp4 23.0 MB
04 Selection Algorithms/029 Quickselect visualization.mp4 22.1 MB
02 Recursion/016 Tower of Hanoi problem implementation.mp4 21.8 MB
02 Recursion/009 Factorial function - head recursion.mp4 21.7 MB
02 Recursion/008 Head recursion and tail recursion implementation.mp4 21.2 MB
02 Recursion/017 Towers of Hanoi - visualizing the stack.mp4 20.7 MB
05 Backtracking/045 Hamiltonian paths (and cycles) introduction.mp4 20.5 MB
08 Divide and Conquer Methods/083 Merge sort theory.mp4 19.7 MB
05 Backtracking/043 N-queens problem and stack memory visualization.mp4 18.8 MB
07 Optimal Packing Problem/078 Bin packing problem introduction.mp4 18.8 MB
09 Common Interview Questions/094 Integer reversion solution.mp4 18.8 MB
04 Selection Algorithms/033 What the problem with pivots_.mp4 18.6 MB
02 Recursion/011 Factorial function - tail recursion.mp4 17.3 MB
05 Backtracking/059 Sudoku introduction.mp4 17.1 MB
02 Recursion/003 Stack memory and heap memory simulation.mp4 16.8 MB
05 Backtracking/039 N-queens problem introduction.mp4 15.8 MB
02 Recursion/012 Fibonacci numbers - head recursion.mp4 15.7 MB
05 Backtracking/037 Backtracking introduction.mp4 14.9 MB
10 Course Materials (DOWNLOADS)/104 AlgorithmicJava.zip 14.6 MB
09 Common Interview Questions/101 Anagram problem solution.mp4 13.2 MB
06 Dynamic Programming/064 Fibonacci numbers introduction.mp4 12.5 MB
03 Search Algorithms/025 What is binary (logarithmic) search_.mp4 11.5 MB
05 Backtracking/046 Hamiltonian cycle illustration.mp4 10.2 MB
05 Backtracking/056 Maze problem introduction.mp4 9.6 MB
02 Recursion/002 What are stack and heap memory_.mp4 9.1 MB
05 Backtracking/038 Brute-force search and backtracking.mp4 8.7 MB
02 Recursion/010 Factorial problem - visualizing the stack.mp4 8.7 MB
05 Backtracking/050 Coloring problem visualization.mp4 8.5 MB
03 Search Algorithms/022 Linear search implementation.mp4 8.4 MB
05 Backtracking/053 Knight's tour introduction.mp4 8.2 MB
01 Introduction/001 Introduction.mp4 8.1 MB
11 Algorhyme FREE Algorithms Visualizer App/105 What is Algorhyme_.mp4 7.5 MB
08 Divide and Conquer Methods/082 Binary search revisited.mp4 6.8 MB
05 Backtracking/040 What is the search tree_.mp4 6.4 MB
03 Search Algorithms/021 What is linear search_.mp4 4.9 MB
04 Selection Algorithms/035 Combining algorithms - introselect algorithm.mp4 4.6 MB
02 Recursion/020 Iteration and recursion revisited.mp4 4.4 MB
08 Divide and Conquer Methods/089 Closest pair of points implementation.en.srt 32.4 KB
06 Dynamic Programming/066 Knapsack problem introduction.en.srt 25.8 KB
08 Divide and Conquer Methods/087 Closest pair of points problem introduction I.en.srt 22.2 KB
06 Dynamic Programming/067 Knapsack problem example.en.srt 18.8 KB
06 Dynamic Programming/073 Rod cutting problem example.en.srt 16.8 KB
09 Common Interview Questions/097 Two eggs problem solution II.en.srt 16.0 KB
04 Selection Algorithms/030 Quickselect implementation.en.srt 15.2 KB
06 Dynamic Programming/075 Subset sum problem introduction.en.srt 14.5 KB
02 Recursion/006 Recursion and stack memory (stack overflow).en.srt 14.4 KB
06 Dynamic Programming/076 Subset sum problem example.en.srt 14.2 KB
04 Selection Algorithms/028 Quickselect introduction - Hoare algorithm.en.srt 14.0 KB
09 Common Interview Questions/103 Largest sum subarray problem solution.en.srt 13.8 KB
08 Divide and Conquer Methods/081 What are divide-and-conquer approaches_.en.srt 13.4 KB
05 Backtracking/047 Hamiltonian cycle implementation I.en.srt 13.3 KB
04 Selection Algorithms/029 Quickselect visualization.en.srt 13.1 KB
05 Backtracking/054 Knight's tour implementation I.en.srt 12.9 KB
06 Dynamic Programming/074 Rod cutting problem implementation.en.srt 12.7 KB
05 Backtracking/039 N-queens problem introduction.en.srt 12.6 KB
05 Backtracking/049 Coloring problem introduction.en.srt 12.4 KB
08 Divide and Conquer Methods/083 Merge sort theory.en.srt 12.4 KB
05 Backtracking/041 N-queens problem implementation I.en.srt 12.2 KB
07 Optimal Packing Problem/078 Bin packing problem introduction.en.srt 12.1 KB
03 Search Algorithms/026 Binary search implementation.en.srt 12.1 KB
06 Dynamic Programming/063 Dynamic programming introduction.en.srt 11.9 KB
06 Dynamic Programming/072 Rod cutting problem introduction.en.srt 11.8 KB
06 Dynamic Programming/065 Fibonacci numbers implementation.en.srt 11.6 KB
04 Selection Algorithms/036 Online selection - the secretary problem.en.srt 11.6 KB
02 Recursion/004 Recursion introduction.en.srt 11.5 KB
09 Common Interview Questions/092 Palindrome problem solution.en.srt 11.2 KB
09 Common Interview Questions/096 Two eggs problem solution I.en.srt 11.1 KB
04 Selection Algorithms/034 Advanced selection - median of medians algorithm.en.srt 11.0 KB
05 Backtracking/060 Sudoku implementation I.en.srt 11.0 KB
05 Backtracking/045 Hamiltonian paths (and cycles) introduction.en.srt 10.9 KB
09 Common Interview Questions/099 Duplicates in an array problem solution.en.srt 10.5 KB
06 Dynamic Programming/077 Subset sum problem implementation.en.srt 10.4 KB
02 Recursion/017 Towers of Hanoi - visualizing the stack.en.srt 10.2 KB
05 Backtracking/043 N-queens problem and stack memory visualization.en.srt 9.7 KB
04 Selection Algorithms/027 Selection algorithms introduction.en.srt 9.6 KB
09 Common Interview Questions/094 Integer reversion solution.en.srt 9.3 KB
06 Dynamic Programming/068 Knapsack problem implementation I.en.srt 9.0 KB
07 Optimal Packing Problem/079 Bin packing problem implementation.en.srt 8.9 KB
08 Divide and Conquer Methods/084 Merge sort implementation.en.srt 8.8 KB
05 Backtracking/048 Hamiltonian cycle implementation II.en.srt 8.8 KB
05 Backtracking/051 Coloring problem implementation I.en.srt 8.8 KB
04 Selection Algorithms/033 What the problem with pivots_.en.srt 8.6 KB
05 Backtracking/057 Maze problem implementation I.en.srt 8.6 KB
05 Backtracking/058 Maze problem implementation II.en.srt 8.5 KB
05 Backtracking/037 Backtracking introduction.en.srt 8.5 KB
02 Recursion/015 Towers of Hanoi problem introduction.en.srt 8.5 KB
02 Recursion/003 Stack memory and heap memory simulation.en.srt 8.5 KB
05 Backtracking/042 N-queens problem implementation II.en.srt 8.4 KB
02 Recursion/008 Head recursion and tail recursion implementation.en.srt 8.2 KB
02 Recursion/009 Factorial function - head recursion.en.srt 8.1 KB
05 Backtracking/059 Sudoku introduction.en.srt 8.0 KB
02 Recursion/011 Factorial function - tail recursion.en.srt 7.8 KB
05 Backtracking/062 What is the issue with NP-complete problems_.en.srt 7.6 KB
05 Backtracking/056 Maze problem introduction.en.srt 7.6 KB
02 Recursion/016 Tower of Hanoi problem implementation.en.srt 7.4 KB
05 Backtracking/052 Coloring problem implementation II.en.srt 7.4 KB
05 Backtracking/050 Coloring problem visualization.en.srt 6.8 KB
05 Backtracking/055 Knight's tour implementation II.en.srt 6.3 KB
02 Recursion/010 Factorial problem - visualizing the stack.en.srt 6.3 KB
02 Recursion/012 Fibonacci numbers - head recursion.en.srt 6.3 KB
05 Backtracking/046 Hamiltonian cycle illustration.en.srt 6.2 KB
02 Recursion/005 Adding numbers_ iteration vs recursion.en.srt 6.0 KB
08 Divide and Conquer Methods/088 Closes pair of points problem introduction II.en.srt 6.0 KB
05 Backtracking/038 Brute-force search and backtracking.en.srt 5.6 KB
06 Dynamic Programming/064 Fibonacci numbers introduction.en.srt 5.5 KB
06 Dynamic Programming/069 Knapsack problem implementation II.en.srt 5.4 KB
03 Search Algorithms/025 What is binary (logarithmic) search_.en.srt 5.4 KB
02 Recursion/002 What are stack and heap memory_.en.srt 5.3 KB
09 Common Interview Questions/101 Anagram problem solution.en.srt 5.2 KB
05 Backtracking/053 Knight's tour introduction.en.srt 5.2 KB
05 Backtracking/040 What is the search tree_.en.srt 4.7 KB
05 Backtracking/061 Sudoku implementation II.en.srt 4.3 KB
03 Search Algorithms/022 Linear search implementation.en.srt 4.1 KB
01 Introduction/001 Introduction.en.srt 3.2 KB
11 Algorhyme FREE Algorithms Visualizer App/106 Algorhyme - Algorithms and Data Structures.html 2.9 KB
08 Divide and Conquer Methods/082 Binary search revisited.en.srt 2.7 KB
04 Selection Algorithms/032 Solution - sorting with selection.html 2.6 KB
02 Recursion/007 Recursion optimization in Java.html 2.3 KB
03 Search Algorithms/021 What is linear search_.en.srt 2.2 KB
05 Backtracking/044 How to earn $1 million with N-queens problem_.html 2.2 KB
06 Dynamic Programming/070 Exercise - recursive implementation.html 2.1 KB
02 Recursion/020 Iteration and recursion revisited.en.srt 2.1 KB
04 Selection Algorithms/035 Combining algorithms - introselect algorithm.en.srt 2.1 KB
08 Divide and Conquer Methods/086 Solution - sort the items in descending order.html 1.9 KB
02 Recursion/014 Solution - Fibonacci-numbers with tail recursion.html 1.8 KB
08 Divide and Conquer Methods/090 Closes pair of points - useful article.html 1.6 KB
06 Dynamic Programming/071 Solution - recursive implementation.html 1.5 KB
02 Recursion/013 Exercise - Fibonacci-numbers with tail recursion.html 1.3 KB
09 Common Interview Questions/095 The two eggs problem overview.html 1.2 KB
03 Search Algorithms/024 Solution - linear search with recursion.html 1.2 KB
07 Optimal Packing Problem/080 Bin packing problem - useful article.html 1.2 KB
09 Common Interview Questions/098 Duplicates in an array problem overview.html 1.1 KB
09 Common Interview Questions/091 Palindrome problem overview.html 1.1 KB
04 Selection Algorithms/031 Exercise - sorting with selection.html 1.1 KB
02 Recursion/018 Exercise - solving recursion with iteration.html 1.1 KB
02 Recursion/019 Solution - solving recursion with iteration.html 1.1 KB
08 Divide and Conquer Methods/085 Exercise - sort the items in descending order.html 1.1 KB
03 Search Algorithms/023 Exercise - linear search with recursion.html 1.1 KB
09 Common Interview Questions/093 Integer reversion problem overview.html 1.1 KB
09 Common Interview Questions/102 Largest sum subarray problem overview.html 1.1 KB
09 Common Interview Questions/100 Anagram problem overview.html 1.0 KB
10 Course Materials (DOWNLOADS)/104 Course materials.html 962 bytes
11 Algorhyme FREE Algorithms Visualizer App/105 What is Algorhyme_.en.vtt 8 bytes
udemy-dl.log 0 bytes

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

File List

Download Torrent

Related Resources

Copyright Infringement