You are given an integer array nums and an array of queries queries, where each queries[i] is a pair [val_i, index_i].

For each query queries[i], apply the update nums[index_i] = nums[index_i] + val_i. After modifying nums, compute the sum of all even values currently present in the array.

Return an integer array representing the sum of even numbers after applying each query sequentially.

Constraints:

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

• $-10^4 \leq$ nums[i] $\leq 10^4$

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

• $-10^4 \leq$ val_i $\leq 10^4$

• $0 \leq$ index_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.