This problem was asked by Google.
Given a list of numbers with only 3 unique numbers (1, 2, 3), sort the list in O(n) time.
Input: [3, 3, 2, 1, 3, 2, 1]
Output: [1, 1, 2, 2, 3, 3, 3]
challenge-21
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||