Subset Sum Problem (Dynamic Programming) Theory, Example and Implementation in Python
🎁 FREE Algorithms Interview Questions Course - https://bit.ly/3s37wON
🎁 FREE Machine Learning Course - https://bit.ly/3oY4aLi
🎁 FREE Python Programming Course - https://bit.ly/3JJMHOD
📱 FREE Algorithms Visualization App - http://bit.ly/algorhyme-app
In this lecture we are going to discuss another dynamic programming related approach - the subset sum problem 🔥🔥
If you are interested in algorithms such as recursion, selection algorithms, backtracking, dynamic programming and divide-and-conquer approach, then join 'Algorithmic Problems' course! Let's consider the topics one by one:
*Section 1 - RECURSION*
✔️what are recursion and recursive methods
✔️stack memory and heap memory overview
✔️what is stack overflow?
✔️Fibonacci numbers
✔️factorial function
✔️tower of Hanoi problem
*Section 2 - SEARCH ALGORITHMS*
✔️linear search approach
✔️binary search algorithm
*Section 3 - SELECTION ALGORITHMS*
✔️what are selection algorithms?
✔️how to find the k-th order statistics in O(N) linear running time?
✔️quickselect algorithm
✔️median of medians algorithm
✔️the secretary problem
*Section 4 - BACKTRACKING*
✔️what is backtracking?
✔️n-queens problem
✔️Hamiltonian cycle problem
✔️coloring problem
✔️knight's tour problem
*Section 5 - DYNAMIC PROGRAMMING*
✔️what is dynamic programming?
✔️knapsack problem
✔️rod cutting problem
✔️subset sum problem
*Section 6 - OPTIMAL PACKING *
✔️what is optimal packing?
✔️bin packing problem
*Section 7 - DIVIDE AND CONQUER APPROACHES*
✔️what is the divide and conquer approach?
✔️dynamic programming and divide and conquer method
✔️how to achieve sorting in O(NlogN) with merge sort?
✔️the closest pair of points problem
In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Python.
Let's get started!
✅ Facebook: https://www.facebook.com/globalsoftwarealgorithms/
✅ Instagram: https://www.instagram.com/global.software.algorithms
Видео Subset Sum Problem (Dynamic Programming) Theory, Example and Implementation in Python канала Global Software Support
🎁 FREE Machine Learning Course - https://bit.ly/3oY4aLi
🎁 FREE Python Programming Course - https://bit.ly/3JJMHOD
📱 FREE Algorithms Visualization App - http://bit.ly/algorhyme-app
In this lecture we are going to discuss another dynamic programming related approach - the subset sum problem 🔥🔥
If you are interested in algorithms such as recursion, selection algorithms, backtracking, dynamic programming and divide-and-conquer approach, then join 'Algorithmic Problems' course! Let's consider the topics one by one:
*Section 1 - RECURSION*
✔️what are recursion and recursive methods
✔️stack memory and heap memory overview
✔️what is stack overflow?
✔️Fibonacci numbers
✔️factorial function
✔️tower of Hanoi problem
*Section 2 - SEARCH ALGORITHMS*
✔️linear search approach
✔️binary search algorithm
*Section 3 - SELECTION ALGORITHMS*
✔️what are selection algorithms?
✔️how to find the k-th order statistics in O(N) linear running time?
✔️quickselect algorithm
✔️median of medians algorithm
✔️the secretary problem
*Section 4 - BACKTRACKING*
✔️what is backtracking?
✔️n-queens problem
✔️Hamiltonian cycle problem
✔️coloring problem
✔️knight's tour problem
*Section 5 - DYNAMIC PROGRAMMING*
✔️what is dynamic programming?
✔️knapsack problem
✔️rod cutting problem
✔️subset sum problem
*Section 6 - OPTIMAL PACKING *
✔️what is optimal packing?
✔️bin packing problem
*Section 7 - DIVIDE AND CONQUER APPROACHES*
✔️what is the divide and conquer approach?
✔️dynamic programming and divide and conquer method
✔️how to achieve sorting in O(NlogN) with merge sort?
✔️the closest pair of points problem
In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Python.
Let's get started!
✅ Facebook: https://www.facebook.com/globalsoftwarealgorithms/
✅ Instagram: https://www.instagram.com/global.software.algorithms
Видео Subset Sum Problem (Dynamic Programming) Theory, Example and Implementation in Python канала Global Software Support
Показать
Комментарии отсутствуют
Информация о видео
17 декабря 2020 г. 18:47:04
00:29:23
Другие видео канала
Boosting in Machine Learning - Final FormulaAlgorhyme - Visualizing Algorithms and Data StructuresData Structures (B-Trees) Behind Databases and the External MemoryPageRank Algorithm - ProblemsPython Programming - References and Values (Call by Reference and Call by Value)Computer Vision - Haar-FeaturesComputer Vision - Integral Images (Artificial Intelligence Bootcamp in Python)Testing for Cointegration for Statistical Arbitrage and Pairs-Trading Strategies (Python)PageRank Algorithm - Graph Representation Of The WWWKosaraju's Algorithm - Strongly Connected Components (Graph Algorithms in Java)Stack Memory & Heap Memory | What is The Difference Between Stacks and Heaps?PageRank Algorithm - Final FormulaBlack-Scholes Formula - Option Pricing with Monte-Carlo Simulation in PythonDynamic Programming and Directed Acyclic Graphs (DAGs)PageRank Algorithm - ExampleBrute-Force Substring Search AlgorithmBoosting in Machine Learning - EquationsPageRank Algorithm - Crawling The Web With BFSPageRank Algorithm - Matrix RepresentationPageRank Algorithm - Random Surfer Model