How to prove problem have overlapping substructure
Answers
Answered by
0
Answer:
We should prove problems have overlapping substructure by dynamic programming.
Hope it will help u and please like and follow and also don't forget to click on brainliest answer and fine comments on my answer.
Answered by
0
Answer:
Explanation:
1) Overlapping Subproblems. 2) Optimal Substructure. 1) Overlapping Subproblems: Like Divide and Conquer, Dynamic Programming combines solutions to sub-problems. Dynamic Programming is mainly used when solutions of same subproblems are needed again and again.
Similar questions