maximum-gap

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

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

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

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

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

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
</ul>

maximumGap

Maximum Gap

Array

Sorting

Bucket Sort

Radix Sort

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie