Consecutive Available Seats II

Given a dynamic row of seats with operations that occupy or free individual seats, implement a query that finds and optionally reserves k consecutive available seats (or reports failure). The core challenge is to maintain and query maximal free segments efficiently under many updates, typically solved with interval/segment-tree or ordered-set techniques.