Leetcode Hard Maximum Gap

[sardonicankita]

Aim

To solve the Leetcode Hard problem "Maximum Gap" in C++. Admins please assign this to me under LGM SOC'21.

Details

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.

Example 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.

Programming language

• [ ] C
• [x] C++
• [ ] Java
• [ ] Python

[Saurabh4626]

try using Bucket Sort

[Adarsh357]

I want to try this

[kamleshjoshi8102]

hi @Saurabh4626 @Amit366 I Want to provide my code under LGMSOC'21 in python

[kumarshobhit]

I would like to contribute in java

[Pratik57]

I Would like to do it in c under LGMSOC21