Maximum Gap

Hard

Given an integer array nums, return the maximum difference between two successive elements once the array is sorted in ascending order. If the array contains fewer than two elements, return 0.

Example 1

Input:  nums = [3,6,9,1]
Output: 3

Example 2

Input:  nums = [10]
Output: 0

Constraints

• 1 <= nums.length <= 10^5
• 0 <= nums[i] <= 10^9