dsa1 min read
Maximum Width Ramp — Monotonic Stack + Two Pass
Find max j-i where i<j and nums[i]<=nums[j]. Build decreasing monotonic stack for left candidates, then scan from right to match.
Read →
All Posts
1575 articles
dsa1 min read
132 Pattern — Monotonic Stack from Right
Find i<j<k where nums[i]<nums[k]<nums[j]. Scan right-to-left with decreasing stack; track max popped element as potential 'nums[k]' candidate.
Read →
dsa1 min read
Maximal Rectangle — Histogram per Row
Find the largest rectangle in a binary matrix. Build histogram row by row (reset to 0 on '0'), apply Largest Rectangle in Histogram each row.
Read →
dsa1 min read
Next Greater Element II — Circular Monotonic Stack
Next greater element in circular array. Iterate twice (2n) but use index mod n. Same decreasing stack pattern.
Read →
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 →
Page 115 of 315