Amazon Interview Report
- 1of 1 vote
AnswersGiven an array of integers, but instead of all integers having the same length each can have a different number of bits. For example, the numbers 0 or 1 have 1 bit, 2, 3 have 2 bits, 4,5,6,7 have 3 bits. The TOTAL number of bits of all the integers in the array is n. Describe how to sort the array in O(n) time.
- randyma12 September 14, 2014 in United States| Report Duplicate | Flag | PURGE
Amazon Computer Scientist Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.