dsa1 min read
Non-overlapping Intervals — Interval Scheduling
Minimum removals to make intervals non-overlapping. Sort by end time; greedily keep earliest-ending intervals, count conflicts.
Read →
All Posts
1276 articles
dsa1 min read
Minimum Number of Arrows to Burst Balloons
Find minimum arrows to burst all balloons (intervals). Sort by end; one arrow can burst all overlapping intervals. Count arrows needed.
Read →
dsa1 min read
Gas Station — Greedy Circular
Find starting gas station index to complete circular route. If total gas >= total cost, a solution exists. Track running balance; reset start when negative.
Read →
dsa1 min read
Candy — Two-Pass Greedy
Distribute minimum candies with higher-rated children getting more than neighbors. Two-pass: left-to-right for ascending, right-to-left for descending.
Read →
dsa1 min read
Next Greater Element I — Monotonic Stack
For each element in nums1, find next greater element in nums2. Monotonic stack + hashmap: process nums2, pop when greater found, store in map.
Read →
Page 53 of 256