Daily Prep - Wednesday, 2026-07-22
Today’s Targets Completed
DSA - 6 Problems (DP on Subsequences - Day 3 of Dynamic Programming)
- LC1: Subset sum equal to target (DP- 14) (Hard)
- LC2: Partition equal subset sum (Hard)
- LC3: Partition a set into two subsets with minimum absolute sum difference (Hard)
- LC4: Count subsets with sum K (Hard)
- LC5: Count partitions with given difference (Hard)
- LC6: Assign Cookies (Easy)