Home
Topics
Practice
Roadmap
DSA Tracker
Code Editor
Tech Blogs
More
Sign in
Get started
Loading question...
Feedback
Maximum Gap
Medium
00:00
0 users online
Share
Description
Solution
Submissions
Discussion
Given an unsorted array, find the maximum difference between successive elements after sorting.
Sample Input:
[3,6,9,1]
Sample Output:
3
Hints
Hint 1
Use bucket sort (pigeonhole principle)
Hint 2
Create n-1 buckets for n elements
Hint 3
Maximum gap must be between buckets, not within
Code Editor
Reset
Run
Save
Loading...