DEV Community

Abhishek Chaudhary
Abhishek Chaudhary

Posted on

1

Maximum Gap

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

You must write an algorithm that runs in linear time and uses linear extra space.

Example 1:

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

Example 2:

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

Constraints:

  • 1 <= nums.length <= 105
  • 0 <= nums[i] <= 109

SOLUTION:

import heapq

class Solution:
    def maximumGap(self, nums: List[int]) -> int:
        maxGap = float('-inf')
        n = len(nums)
        if n <= 1:
            return 0
        heapq.heapify(nums)
        prev = heapq.heappop(nums)
        while len(nums) > 0:
            curr = heapq.heappop(nums)
            maxGap = max(maxGap, curr - prev)
            prev = curr
        return maxGap
Enter fullscreen mode Exit fullscreen mode

Top comments (0)

AWS GenAI LIVE!

GenAI LIVE! is a dynamic live-streamed show exploring how AWS and our partners are helping organizations unlock real value with generative AI.

Tune in to the full event

DEV is partnering to bring live events to the community. Join us or dismiss this billboard if you're not interested. ❤️