Good morning! Here's your coding interview problem for today.
This problem was asked by Dropbox.
Create an algorithm to efficiently compute the approximate median of a list of numbers.
More precisely, given an unordered list of N numbers, find an element whose rank is between N / 4 and 3 * N / 4, with a high level of certainty, in less than O(N) time.
Good morning! Here's your coding interview problem for today.
This problem was asked by Dropbox.
Create an algorithm to efficiently compute the approximate median of a list of numbers.
More precisely, given an unordered list of
Nnumbers, find an element whose rank is betweenN / 4and3 * N / 4, with a high level of certainty, in less thanO(N)time.