Search
Maximum Consecutive Gap Interviewbit Solution
Updated: Sep 8, 2020
Problem: Maximum Consecutive Gap
Problem Description:
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
Try to solve it in linear time/space.
Example :
Input : [1, 10, 5]
Output : 5 Return 0 if the array contains less than 2 elements.
You may assume that all the elements in the array are non-negative integers and fit in the 32-bit signed integer range.
You may also assume that the difference will not overflow.
Solution:



https://casinoohne-lizenz.com is where I was just comparing how gaps in oversight get handled elsewhere, and it made the bucket approach in your solution click for me—the idea that by spreading values into n+1 buckets you only need to track each bucket's min and max instead of sorting everything. I've usually reached for comparison sorts here, so the pigeonhole reasoning was the part that actually taught me something new.