feerasse / dynamicprogramming

DynamicProgramming

Dynamic Programming is a difficult topic. This repository will document my understanding of this topic. Hopefully it will be of some use to you.

Dynamic Programming Overview

An overview of Dynamic Programming

What is Dynamic Programming?

"Dynamic programming is a technique for solving problems with overlapping subproblems."³

How to idenfity a Dynamic Programming Problem

"The normal form of dynamic programming problem is to calculate the maximum or minimum"¹

"The core of the problem is enumeration. Because we are asked to calculate the max or min, we must enumerate all the feasible answers and find max or min among those."¹

1. Find a recurrence relation
2. Create a recursive solution
3. Save underlying subproblems
4. Turn recursion into iterative loop

Problem Sets

https://leetcode.com/discuss/general-discussion/662866/Dynamic-Programming-for-Practice-Problems-Patterns-and-Sample-Solutions

FootNotes:

1. https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/analysisofdynamicprogramming
2. https://leetcode.com/problems/house-robber/discuss/156523/From-good-to-great.-How-to-approach-most-of-DP-problems
3. https://www.pearson.com/us/higher-education/program/Levitin-Introduction-to-the-Design-and-Analysis-of-Algorithms-3rd-Edition/PGM223052.html