Given an array of n numbers containing only k unique numbers where k << n, sort them in less than O(n log n) time. Also, sort an array containing only numbers 1, 2, and 3.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.