Dynamic Programming

Core concepts of Dynamic Programming, optimal substructure, overlapping subproblems, memoization, and tabulation.

Solving the Fibonacci Sequence problem using 1D tabulation and O(1) space optimization.

Solving the 0/1 Knapsack Problem using a 2D table and space-optimized 1D array.

Finding the length of the longest common subsequence of two strings using 2D and 2-row tabulation.