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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2274. Maximum Consecutive Floors Without Special Floors

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact