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:

Kommentare

Given a character matrix of size N x M in the form of a string array A of size N where A[i] denotes ith row. Each character in the matrix co

Given an n-ary tree of resources arranged hierarchically such that the height of the tree is O(log N) where N is a total number of nodes...

You are given an array of N non-negative integers, A0, A1 ,…, AN-1.Considering each array element Ai as the edge length of some line segment

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target.