Status: IN
Problems partition by which preprocessing unlocks linear-time solution: hashing (Counter/set) for membership and frequency queries vs sorting for positional and pair relationships, with the core query type — lookup or comparison — determining which paradigm applies.
Query type (lookup vs comparison) determines the preprocessing choice
Depends on (SL): hash-preprocessing-universal-first-step, sorted-order-enables-all-efficient-search