<p>Given an integer array <code>nums</code>, return <em>the maximum difference between two successive elements in its sorted form</em>. If the array contains less than two elements, return <code>0</code>.</p>

<p>You must write an algorithm that runs in linear time and uses linear extra space.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,6,9,1]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The sorted form of the array is [1,3,6,9], either (3,6) or (6,9) has the maximum difference 3.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [10]
<strong>Output:</strong> 0
<strong>Explanation:</strong> The array contains less than 2 elements, therefore return 0.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def maximumGap(self, nums: List[int]) -> int:
        if len(nums) < 2:
            return 0
        
        nums_min, nums_max = min(nums), max(nums)
        if nums_min == nums_max:
            return 0
        
        # Bucket size, at least 1
        bucket_size = max(1, (nums_max - nums_min) // (len(nums) - 1))
        
        # Number of buckets
        bucket_num = (nums_max - nums_min) // bucket_size + 1
        
        # Initialize buckets
        buckets = [[float('inf'), float('-inf')] for _ in range(bucket_num)]
        
        # Fill buckets
        for num in nums:
            bucket_index = (num - nums_min) // bucket_size
            buckets[bucket_index][0] = min(buckets[bucket_index][0], num)
            buckets[bucket_index][1] = max(buckets[bucket_index][1], num)
        
        # Filter empty buckets
        buckets = [bucket for bucket in buckets if bucket[0] != float('inf')]
        
        # Calculate maximum gap
        max_gap = 0
        for i in range(1, len(buckets)):
            max_gap = max(max_gap, buckets[i][0] - buckets[i-1][1])
        
        return max_gap
38523