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

Note: Successive elements are adjacent elements in the sorted order of nums.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.