Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
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 603. Consecutive Available Seats
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source