Algorithms | Dynamic Programming | Question 2

We use dynamic programming approach when

(A)

We need an optimal solution

(B)

The solution has optimal substructure

(C)

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

(D)

It\’s faster than Greedy

Answer: (B)
Explanation:

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