You have $n$ holes on the surface of an old table, each hole's position given in an integer array arr. You want to cover all these holes using exactly two boards of the same positive integer length. If a board of length $L$ is placed at position $X$, it will cover any hole whose position is in the range $[X, X + L]$ inclusively.