Open In App
Related Articles

Algorithms | Dynamic Programming | Question 2

Improve Article
Save Article
Like Article

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

Answer: (B)


We use dynamic programming approach when the solution has an optimal substructure.

Hence Option(B) is the correct answer.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 23 Sep, 2018
Like Article
Save Article
Similar Reads