Count number of ways to reach a score |simple dp | Love babbar DSA sheet

Problems:
Reach a given score:

solution:
-------------------------------------------------------------------------------------------------------------------------
Playlist link:

Link to the questions:
__________________________________________________________________________
Connect with me on Linked in:

Connect with me on Instagram:

#lovebabbardsasheet #dp #countways #gfg #coding #softwareengineer #SDE #Placement #competitiveprogramming #faang #matrix

[anupurbamitra]

Please solve "longest increasing sequence forming an arithmetic progression" question.

[nitinkumar]

This problem is exactly analogous or similar to minimum coin change problem in which we have to find min. no. Of ways to make sum 's' using coins[ ] array.

[bishwajeetsharma]

If order doesn't matter then it's completely a fibonacci or climbing stairs problem cause the no of ways to generate score n would be no. of ways to generate (n-3) + no. of ways to generate (n-5) + no. of ways to generate (n-10). But here it is different (kind of min coin change).

[tusharshaily]

As per the video logic : dp[8] = dp[8-5] +dp[8-3] => 2, can someone clear this one as how we are avoiding similar count ?

[devanshverma]

I don't think the second part of your answer is correct where you show how to change the code to yield permutations.
Take 13 for instance, your code will produce 9 whereas the correct #permutations is 5

[roushan]

how you can say the problem is very easy?

[manishgautam]

bhai jb tujhe aata na h to video kyo bnate ho ... phle pd lo... kuchh bhi btae ja rha h... phle recursive solution to bta... ki only testcase pass krane se mtlb h