Skip to content

Backend / Algorithms & data structures / 06_dp/

Dp

index source

This folder has no README. Everything inside it is listed below.

Notes

Dynamic programming — patterns and classic problems 4 DP is "remembered recursion." Identify subproblems, compute each once, reuse via memoization (top-down) or tabulation (bottom-up).
2D dynamic programming 6 The classic table-filling problems. Three of them cover most 2D DP questions: knapsack, longest common subsequence, and edit distance.