dsa1 min read
Minimum Cost to Connect Sticks — Min-Heap Greedy
Minimum cost to connect all sticks. Always connect the two cheapest (Huffman coding variant). Min-heap greedy: cost = sum of merged sticks each round.
Read →
All Posts
1276 articles
dsa1 min read
Partition Labels — Greedy Interval Merge
Partition string so each letter appears in at most one part. Track last occurrence of each char; greedily extend current partition end.
Read →
dsa1 min read
Queue Reconstruction by Height — Greedy Sort + Insert
Reconstruct queue where [h,k] means person of height h has k taller/equal people in front. Sort by height desc (then k asc), insert at index k.
Read →
dsa1 min read
Jump Game VI — Greedy + Monotonic Deque
Maximum score to reach end where each jump is 1..k steps. Monotonic deque (sliding window maximum) of DP values for O(n) solution.
Read →
dsa1 min read
Max Chunks to Make Sorted — Greedy Max Tracking
Find max chunks of array that when sorted individually give fully sorted array. A chunk boundary exists when max(chunk so far) == current index.
Read →
Page 56 of 256