Money Sums (CSES) | Subset Sum DP Explained | Count All Possible Sums Using Dynamic Programming

In this video, we solve the 𝐌𝐨𝐧𝐞𝐲 𝐒𝐮𝐦𝐬 problem from the 𝐂𝐒𝐄𝐒 𝐃𝐲𝐧𝐚𝐦𝐢𝐜 𝐏𝐫𝐨𝐠𝐫𝐚𝐦𝐦𝐢𝐧𝐠 section, which is a perfect example of the classic subset sum problem.⁣⁣ ⁣⁣ Given a list of coins, we determine all the distinct positive sums that can be formed using any subset of the coins. This is a fundamental dynamic programming pattern that appears frequently in coding contests and interviews.⁣⁣ ⁣⁣ 💡 What you'll learn:⁣⁣ - How to use a boolean DP array to track achievable sums⁣⁣ - Why reverse iteration avoids overcounting in subset sum problems⁣⁣ - How to efficiently compute and extract all valid sums⁣⁣ - Real-world applications of subset sum logic⁣⁣ ⁣⁣ This problem is part of our full Dynamic Programming Series, featuring curated problems from 𝐂𝐒𝐄𝐒, 𝐀𝐭𝐂𝐨𝐝𝐞𝐫, 𝐂𝐨𝐝𝐞𝐟𝐨𝐫𝐜𝐞𝐬, 𝐋𝐞𝐞𝐭𝐜𝐨𝐝𝐞, 𝐂𝐨𝐝𝐞𝐂𝐡𝐞𝐟, and more — moving from beginner-friendly explanations to advanced DP techniques.⁣⁣ ⁣ Problem Link : https://cses.fi/problemset/task/1745⁣ ⁣⁣ #MoneySums #SubsetSum #DynamicProgramming #CSES #CompetitiveProgramming