Dynamic Programming in dsa

Dynamic Programming (DP) solves complex problems by breaking them down into simpler subproblems. It solves each subproblem just once and stores the result (memoization or tabulation) to avoid redundant computations. Often used for optimization problems.