Algorithms | Dynamic Programming | Question 2
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
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
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses
are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!