Leetcode 3362. Zero Array Transformation III

Given nums and range queries where each query can reduce any element in its range by at most 1 (chosen independently per index), find the maximum number of queries you can remove so that for every index i the count of remaining queries covering i is at least nums[i]; return -1 if no subset of queries can reduce nums to all zeros.