Intermediate
Data Structures & Algorithms
Q43 / 100
What is dynamic programming?
Correct! Well done.
Incorrect.
The correct answer is B) A technique solving problems by breaking them into overlapping subproblems and storing results to avoid redundant computation
B
Correct Answer
A technique solving problems by breaking them into overlapping subproblems and storing results to avoid redundant computation
Explanation
DP applies to problems with optimal substructure and overlapping subproblems. Results are memoized (top-down) or tabulated (bottom-up) to achieve polynomial complexity instead of exponential.
Progress
43/100