Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Customers with Maximum Number of Transactions on Consecutive Days
Coding
- Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
- Maximum Number of Consecutive Values You Can Make
Coding
- Non-negative Integers without Consecutive Ones
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2274. Maximum Consecutive Floors Without Special Floors
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source