Leetcode 2274. Maximum Consecutive Floors Without Special Floors

Given bottom, top, and a list of special floors, find the longest consecutive run of floors within [bottom, top] that contains no special floor. Sort the special floors and compute the largest gap between consecutive specials (including from bottom to first special and last special to top) to get the answer.