dsa1 min read
Shortest Common Supersequence — LCS + Reconstruct
Find shortest string containing both strings as subsequences. Length = len(s1)+len(s2)-LCS. Reconstruct by tracing DP table.
Read →
All Posts
1575 articles
dsa1 min read
Burst Balloons — Interval DP
Maximize coins by bursting balloons. Key insight: think of last balloon burst in interval [i,j]. dp[i][j] = max coins from interval with k as last balloon.
Read →
dsa1 min read
Best Time to Buy/Sell Stock I — Single Transaction
Maximize profit from a single buy-sell. Track running minimum price; at each day profit = price - min_so_far.
Read →
dsa1 min read
Best Time Buy/Sell Stock II — Unlimited Transactions
Maximize profit with unlimited buy-sell transactions (but hold at most 1 share). Greedy: collect every upward slope.
Read →
dsa1 min read
Best Time Buy/Sell Stock III — At Most 2 Transactions
Maximize profit with at most 2 transactions. Track 4 states: buy1, sell1, buy2, sell2. State machine DP.
Read →
Page 100 of 315