Dynamic Programming (Part 4): Longest Increasing Subsequence (LIS)
The core idea of dynamic programming lies in breaking down a problem into smaller subproblems and storing previous computation results to reduce computational complexity.
Dynamic Programming
Dynamic Programming Series on Stock Problems
The core idea of dynamic programming lies in breaking down a problem into subproblems, retaining previous computational results to reduce the amount of computation needed.
Dynamic Programming (Part 2) - Optimal Subsequence Series
The core idea of dynamic programming lies in breaking down a problem into smaller subproblems, retaining previously computed results to reduce computational effort.
Dynamic Programming (Part 1) - House Robber Series
The core idea of dynamic programming lies in breaking down a problem into smaller subproblems and retaining previously computed results to reduce computational complexity.
