Given an integer array nums of length n and a $2$D array queries, where queries[i] = [l_i, r_i], process each query sequentially as follows:

For each queries[i], select any subset of indices within the range [l_i, r_i] in nums and decrement the values at those selected indices by $1$.

A Zero Array is defined as an array where every element equals $0$.

Return TRUE if it is possible to transform nums into a Zero Array after processing all queries sequentially, otherwise return FALSE.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ queries.length $\leq 10^5$

• queries[i].length $== 2$

• $0 \leq$ l_i $\leq$ r_i $<$ nums.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.