Leetcode 1635. Hopper Company Queries I

Given a dataset of companies and employees and a sequence of queries asking aggregated results (e.g., counts, top/bounds, or filtered selections) possibly interleaved with updates or transfers, implement an engine to answer each query under tight time limits. The core challenge is efficient online query processing and aggregation over large dynamic data, requiring careful indexing or order/statistics-aware structures to meet performance constraints.