Question Detail
Question
Which algorithmic paradigm solves problems by combining optimal solutions to overlapping subproblems using memoization or tabulation?
Correct Answer
Option C is the correct answer.
Detailed Explanation
Dynamic programming caches overlapping subproblem results to prevent redundant calculations, achieving polynomial runtimes.
Hint
No hint available