Dynamic Programming in 30 Minutes
This is a tutorial on how to solve every dynamic programming problem. I first provide a clear explanation of this technique and then solve several example dynamic programming problems:
1. Fibonacci: 2:08
2. Coin Changing Problem: 10:21
3. 0-1 Knapsack Problem: 16:29
4. Largest Sum Contiguous Subarray (LSCS): 23:03
5. Longest Palindromic Subsequence (LPS): 27:53
You will learn about memoization (top-to-bottom) and tabulation (bottom-up) techniques.
Link to sample source code:
(Under src/dynamic_programmin)
https://github.com/ourarash/cpp_tour
Keep in touch with me:
/ ourarash