Leetcode 1845. Seat Reservation Manager
Manage n seats numbered 1..n supporting reserve(), which returns and marks the smallest-numbered available seat, and unreserve(seat), which makes a seat available again; design must handle up to 1e5 operations efficiently (e.g., with a min-heap or ordered set).
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Early December, 2025
Meta
Senior
Hello Interview Premium
Your account is free and you can post anonymously if you choose.