Leetcode 603. Consecutive Available Seats
Given an array representing seat availability (e.g., 0 = available, 1 = occupied) and an integer k, determine whether there exists a contiguous block of k available seats — essentially checking for k consecutive available entries in the array.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.