dsa2 min read
Minimum Cost to Connect Sticks
Find minimum cost to connect all sticks by greedily always merging the two shortest sticks first.
Read →
All Posts
1575 articles
dsa2 min read
IPO
Maximize capital after k IPO investments by greedily picking the highest profit project among affordable ones.
Read →
dsa2 min read
Car Pooling
Check if a car can pick up all passengers by processing start/end events with a sorted timeline or heap.
Read →
dsa2 min read
Furthest Building You Can Reach
Greedily use ladders for the largest climbs and bricks for smaller gaps, managed with a min-heap of ladder sizes.
Read →
dsa3 min read
Process Tasks Using Servers
Assign tasks to available servers using two heaps: one for free servers and one for busy servers sorted by free time.
Read →
Page 130 of 315