Algorithms | Dynamic Programming | Question 2

Last Updated :
Discuss
Comments

We use dynamic programming approach when

We need an optimal solution

The solution has optimal substructure

The given problem can be reduced to the 3-SAT problem

It\'s faster than Greedy

This question is part of this quiz :

Top MCQs on Dynamic Programming with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy