Category
Level
Dynamic programming (DP) solves complex problems by breaking them into overlapping subproblems and using their optimal substructure.