Daily Prep - Friday, 2026-07-24
Today’s Targets Completed
DSA - 4 Problems (Rod Cutting & DP on Strings - Day 5 of Dynamic Programming)
- LC1: Unbounded knapsack (Hard)
- LC2: Rod Cutting Problem | (DP - 24) (Hard)
- LC3: Longest common subsequence (Hard)
- LC4: Print Longest Common Subsequence | (DP - 26) (Hard)