Skip to content
Related Articles

Related Articles

Algorithms | Dynamic Programming | Question 2

View Discussion
Improve Article
Save Article
  • Difficulty Level : Easy
  • Last Updated : 23 Sep, 2018
View Discussion
Improve Article
Save Article

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

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

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!