Leetcode 1272. Remove Interval

Given a sorted list of non-overlapping intervals and a target interval to remove, return the resulting intervals after subtracting the target from each input interval. The core challenge is correctly handling no overlap, partial overlaps (trimming interval ends), and full containment (splitting an interval into up to two pieces).