Dynamic programming is tough. But it’s especially tough if you don’t know that you need to use dynamic programming in the first place? Lots of people struggle …

source

3
Leave a Reply

avatar
3 Comment threads
0 Thread replies
0 Followers
 
Most reacted comment
Hottest comment thread
0 Comment authors
hmmmKonradAnand Inamdar Recent comment authors
  Subscribe  
newest oldest most voted
Notify of
Anand Inamdar
Guest

Thanks a lot👌.

But my request to you is that make a video on How to crack competitive programming contests on Hackerrank, Hackerearth and so on.

You have told that draw a picture. That's greate idea but; during competition we don't have that much time.

So please make a video on it.

I desperately need it. I failed many time to crack those competition even if I am very passionate about programming.

Need help!.

Konrad
Guest

Hi, I read your ebook, and I was wondering if you could tell again why you think DP is better for the CoinChange than a Greedy algorithm? A Greedy one works for every time and takes like 12 lines at O(n*coins). PD seems like a huge overkill to me.

hmmm
Guest

Is tail recursion a form of dynamic programming? It’s like top down but it stops at the bottom.