Which algorithm design paradigm is characterized by solving subproblems and storing their results to avoid redundant computations?

Dynamic Programming

Dynamic Programming (DP) is applicable to problems exhibiting optimal substructure and overlapping subproblems. By using techniques like memoization or tabulation, DP reduces exponential time complexities to polynomial time.