Greedy vs Dynamic programming

#1

Predict True and False: every Greedy Solution Can Be solved using dynamic Programming. How this is true?

#2

Hey @govilayush
A greedy algorithm gives optimal solution for all subproblems, and every subproblem is further dependent on another subproblem. (kind of reccurence) though there will be no overlapping cases.

So hence DP can also be used to solve it .

This should be the reason according to me

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.