Available question text
Given an integer array, find the maximum difference between successive elements in its sorted order; if fewer than two elements return 0. The catch is to achieve linear time and linear extra space (so use a bucket/pigeonhole or radix-style approach instead of an O(n log n) sort).
Related questions
Continue with questions that share topics or the same question type.
- Top K Frequent Elements
Coding · Array · Bucket Sort · Counting
- Top K Frequent Words
Coding · Array · Bucket Sort · Counting
- Maximum Bitwise AND After Increment Operations
Coding · Array · Bit Manipulation · Greedy
- Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 164. Maximum Gap
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Waymo
Maximum Gap
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 88.4. This is not an interview probability.
View source