Coin Combination 1 | CSES - Dynamic Programming Set | DP | Problem 3/19

00:00 Problem Statement
01:35 Approach Discussion
15:56 Recursive Relation
19:25 Recursive Code
21:36 Overlapping Sub-Problems
24:06 Memoization/Bottom-Top/Recursive DP
25:08 Time and Space Complexity

This a playlist has questions from CSES problem set, DP section.
Dynamic programming is a crucial topic to master while preparing for interviews of top tech companies.In this series PPa Mentor Suraj Singh will be discussing with you the approach to solve such questions and explain the possible solutions.
Suraj is also also an expert at Codeforces and 5 star at Codechef

If you are preparing for the coding interviews for top product-based companies then you should check out "Renaissance" our coding interview preparation platform where we teach our students how to master DSA, System design, low-level design, and how to become 100% coding interview ready!

[antaniogrizman]

❤best one
Searching for recursive solution and found only this one

[mdh]

hello
i think the code have a problem
in a for loop you should store the solve(x-a[i]) in the new valiable and check if it isnt negetive then add to the ans
and then u can return the ans
im not sure it is my opinion

[animehubu]

Coin combination was explained brilliantly please make more videos on other topics as well.