The fastest way to solve this

Given an array \(S\) which is a sorted array of integers.

What is the fastest running time to find the maximum \(x-y\) where \(x, y \in S\)

×

Problem Loading...

Note Loading...

Set Loading...