Greedy vs Dynamic Programming

Medium

computer-science Databricks Amazon

When does a greedy algorithm fail to find the optimal solution?

Multiple Choice

When the input is unsorted When making the locally best choice at each step does not guarantee a globally optimal result When the problem has only one feasible solution Greedy algorithms always find the optimal solution

Correct!

Incorrect — try again next time!

Upgrade to Pro to unlock solutions and explanations

Greedy vs Dynamic Programming

Multiple Choice

Related problems

Deep-dive guides