dsa3 min read
Find K Closest Elements
Find K closest elements to x in a sorted array using binary search to find the optimal left boundary.
Read →
All Posts
1575 articles
dsa2 min read
Kth Largest Element in an Array
Find the Kth largest element using quickselect O(n) average or a min-heap of size K in O(n log k).
Read →
dsa2 min read
Top K Frequent Elements
Return the K most frequent elements using a frequency map plus min-heap, or bucket sort for O(n) solution.
Read →
dsa1 min read
Sort Characters By Frequency
Sort characters in a string by decreasing frequency using a frequency counter and max-heap or bucket sort.
Read →
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 →
Page 127 of 315