Widest Gap — Solution & Editorial

Back to the Problem

Sort and scan adjacent pairs.

Complexity: O(N log N)