Topologically sorting today's tasks...
Topologically sorting today's tasks...
Efficiently track min/max elements and process by priority
Given an unsorted array of integers and an integer k, find the kth largest element in the array.
Given k sorted arrays, merge them into one sorted array.
Design a data structure that supports adding integers from a stream and finding the median of all elements added so far.
You have a collection of stones, each with a positive integer weight.
Master the fundamental pattern. Each problem teaches you when and how to apply this technique.