Leetcode 715. Range Module

Design a data structure that maintains a dynamic set of half-open intervals supporting addRange (insert and merge overlaps), removeRange (subtract and split intervals), and queryRange (check if an interval is fully covered). The core challenge is efficiently managing interval merges/splits and coverage checks under up to 10^4 operations with coordinates up to 10^9.