dsa1 min read
Perfect Squares — Coin Change with Squares
Minimum perfect squares summing to n. Isomorphic to Coin Change where coins = all perfect squares ≤ n.
Read →
All Posts
1575 articles
dsa1 min read
Jump Game — Greedy Reachability
Check if you can reach the last index. Greedy: track furthest reachable index. If current position > reach, stuck.
Read →
dsa1 min read
Jump Game II — Minimum Jumps Greedy
Find minimum jumps to reach the last index. Greedy: at each jump boundary, extend to the farthest reachable position.
Read →
dsa1 min read
Decode Ways — Counting DP
Count ways to decode a digit string as letters (A=1,...,Z=26). DP: single digit + valid double digit transitions.
Read →
dsa1 min read
Word Break — Reachability DP
Check if string can be segmented into dictionary words. DP: dp[i]=true if some dp[j] is true and s[j:i] is in wordDict.
Read →
Page 96 of 315