An organization has rented a series of consecutive building floors spanning from bottom to top, inclusive. You are given two integers bottom and top, along with an integer array special, where each special[i] represents a designated special floor within this range.

Return the maximum number of consecutive floors in the range $[$bottom, top$]$ that do not contain any special floor.

Constraints:

• $1 \leq$ special.length $\leq 10^5$

• $1 \leq$ bottom $\leq$ special[i] $\leq$ top $\leq 10^9$

• All the values of special are unique.

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.