leetcode-maximum-gap.jl

julia> function sol(arr)
           # Bail early if too short
           length(arr) < 2 && return 0
           # Idea - normalize to positive ints and use RadixSort
           # then take the maximum of the diff
           mini = minimum(arr)
           # Use ternary operator `?` and broadcasted in-place addition `.+=`
           mini <= 0 ? arr .+= abs(mini) : nothing
           # Use in-place RadixSort to modify `arr`
           sort!(arr, alg = RadixSort)
           # Take the max of the diff
           maximum(diff(arr))
       end
sol (generic function with 1 method)

julia> sol([3,6,9,1])
3