← Dynamic Programming lineD18Stop 48 of 210

Count Subsets with Sum

Name: Count Subsets with Sum
Uploaded: 2026-08-25T11:55:43.000Z
Duration: 33 min 22 s
Channel: codestorywithMIK
Description: Video lecture "Count Subsets with Sum" by codestorywithMIK, part of the Dynamic Programming chapter of the Data Structures & Algorithms course (33:22).

Knapsack · 33:22Knapsack Series · DP Concepts & Qns-43

MIK's code LeetCode ↗ YouTube ↗

My notes

About this video

Video lecture "Count Subsets with Sum" by codestorywithMIK, part of the Dynamic Programming chapter of the Data Structures & Algorithms course (33:22).

Patterns: Knapsack
Chapter: Dynamic Programming
Duration: 33:22
Code: MIK's solution on GitHub

Fractional Knapsack
0/1 Knapsack
0/1 Knapsack
0/1 Knapsack
Subset Sum Problem
Partition Equal Subset Sum (LeetCode 416)
Partitions with Given Difference leetcode
Target Sum (LeetCode 494)

Video by codestorywithMIK on YouTube Like the video? Leave a like and comment on YouTube ↗

Count Subsets with Sum

My notes

About this video

Related problems