Doubt on greedy algo

#1

i dont understand the answer ,plz help

#2

hello @samarthagarwal023

pls share thr question in which u have doubt

#3

For a problem that can be solved using DP and Greedy. Answer is O(memory) (DP)>= O(memory) (Greedy) && O(time) (DP)>= O(time) (Greedy) .plz explain it

#4

dp compute and store answer of all valid possibilities and because of that it needs more space and time.
whereas in greedy instead of trying all possibilities we only pick local optimal thats why it takes comparatively less time and space

#5

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.