Question

In dynamic programming, which principle ensures correctness by solving overlapping subproblems and storing results?

A Greedy choice property
B Optimal substructure
C Divide and conquer
D Branch and bound
E Randomization
Practice Next

Hey! Ask a query