Combination Sum IV || Dynamic Programming Interview Series || Leetcode

[NasaVinDiesel]

This video made the solution look so simple.

[watchlistsclips]

It's so funny how you deleted my comment when i commented that "Everyone dislike this video". There is a reason behind that because you told us code but you didn't explain what's the code exactly.That is the reason behind 22 dislikes for your video.For the next time please tell us what is in the code man i am talking about this line "a[i]+=a[i-x]" you should have explained this clearly why you are writing and how it is coming which you didn't then your channel will get good recognition you should not make this mistake again because if you do this again people will leave your channel as their last choice because you are not digesting them solution

[abhishtgupta]

FINALLY! NOW I understand the famous coin change problem!

[anantsaxena]

what if I want to print those ways, like in a list of list containing all the combinations
Like {{1, 1, 1, 1, 1}, {1, 2, 2}, {2, 3}, {1, 1, 3}, {1, 1, 1, 2}}
can we apply dp in that case, because as I observed many problems of dp covers "number of ways" or "count"

[vishalmishra]

Thanks for the video. It helped a lot:)

[shubhisingh]

Thankyou so much for the negative variation explanation :D

[joekurokawa]

wow I finally got this problem, I will remember those rupee coins next time !!

[danghuynguyen]

I have a question, what if the order doesn't matter. For example (1, 1, 2), (1, 2, 1) and (2, 1, 1) count as 1

[SandeepMishra-vcru]

Why you put a[0]=1, a[0] is the no of ways to get the sum as 0. But here all the value in nums array is greater than zero.
so a[0] should be 0.

[ashiquddinpranto]

This playlist contains a video of you twice. Video numbers 2, 3 are the same and 4, 5 are the same.

[parassikka]

Can you explain why it fails for int type dp array?

[himanshubansal]

Is there any reason why the code works with unsigned int / unsigned long long but not with long / long long?