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: http://www.geeksforgeeks.org/dynamic-programming-set-2-optimal-substructure-property/

Option (D) is incorrect because Greedy algorithms are generally faster than Dynamic programming. See http://www.geeksforgeeks.org/greedy-algorithms-set-1-activity-selection-problem/

Quiz of this Question