<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:
        min_num = nums[0]
        max_num = nums[0]
        for num in nums[1:]:
            min_num = min(min_num, num)
            max_num = max(max_num, num)

        num_buckets = len(nums)
        bucket_size = (max_num - min_num) // num_buckets + 1
        buckets: List[List[int]] = [[inf, -inf] for _ in range(num_buckets)]

        for num in nums:
            bucket_id = (num - min_num) // bucket_size
            # print(bucket_id)

            buckets[bucket_id] = [
                min(buckets[bucket_id][0], num),
                max(buckets[bucket_id][1], num)
            ]

        ans = 0
        left = 0
        right = 1
        while right < len(buckets):
            if buckets[right][0] != inf:
                ans = max(ans, buckets[right][0] - buckets[left][1])
                left = right

            right += 1

        return ans




        
36033