Leetcode 2793. Status of Flight Tickets

Given N flight tickets and a sequence of operations that set or change the status of contiguous ticket ranges and ask for status information (e.g., count or positions of tickets with a given status), implement a data structure to handle many interleaved range updates and queries efficiently—typically solved with interval mapping/ordered maps or a segment tree with lazy propagation to support fast range assignment, splits/merges, and queries.