Given a $0$ indexed integer array nums and two integers modulo and k.

A subarray from index l to r is defined as interesting if, letting cnt be the number of indices i in the range l $\leq$ i $\leq$ r such that nums[i] % modulo == k, the condition cnt % modulo == k holds true.

Return the total number of interesting subarrays.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^9$

• $1 \leq$ modulo $\leq 10^9$

• $0 \leq$ k $<$ modulo

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.