← Questions
Maximum gap
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an unsorted array, return the largest difference between two neighbours in its sorted order, in linear time and space. The trick is bucket sort (pigeonhole): the maximum gap can never fall inside a bucket, only between buckets.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding