Available question text
Support two booking operations on n rows with m seats each: gather(k,maxRow) must find the smallest row ≤ maxRow with k consecutive free seats and return the starting seat, while scatter(k,maxRow) must determine (and if possible allocate) k seats across rows 0..maxRow using the smallest row and seat numbers. The challenge is to maintain per-row free-seat information and support efficient range-max and prefix-sum queries/updates to locate contiguous blocks and verify/perform greedy allocations.
Related questions
Continue with questions that share topics or the same question type.
- Alternating Groups I
Coding
- Alternating Groups II
Coding · Array · Sliding Window
- Alternating Groups III
Coding
- Assign Elements to Groups with Constraints
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 2286. Booking Concert Tickets in Groups
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source