dsa2 min read
Kth Largest Element in a Stream
Maintain a min-heap of size K to track the Kth largest element as numbers are added to a stream.
Read →
Top-k
3 articles
dsa2 min read
K Closest Points to Origin
Find K points closest to the origin using a max-heap of size K or quickselect for O(n) average.
Read →
dsa1 min read
Find Subsequence of Length K With the Largest Sum
Find the subsequence of length k with the largest sum by selecting top k values while preserving original order.
Read →