Zero Array Transformation III
Try to solve the Zero Array Transformation III problem.
We'll cover the following...
We'll cover the following...
Statement
You are given an integer array nums and a list of range queries queries, where each query queries[i] = [l_i, r_i] represents an operation that can be applied at most once.
When you apply a query [l_i, r_i], you choose an integer decrement amount for each index j in the range l_i \leq j \leq r_i, and subtract that amount from nums[j]. Each chosen decrement must be non negative, and after all applied queries, every element of nums must be exactly