Given a binary array seats representing a row of seats, where seats[i] = 1 means the $i^{th}$ seat is occupied and seats[i] = 0 means the $i^{th}$ seat is empty, choose an empty seat for Alex such that the distance to the nearest occupied seat is maximized.

Return the maximum possible distance between Alex and the closest occupied seat.

Constraints:

• $2 \leq$ seats.length $\leq 2 \times 10^4$

• seats[i] is either $0$ or $1$

• At least one seat is empty

• At least one seat is occupied

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.