* [164] Maximum Gap * * Given an unsorted array, find the maximum difference between the successive elements in its sorted form. * * Return 0 if the array contains less than 2 elements. * * Example 1: * * * Input: [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. * * Example 2: * * * I
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected