Given an array of integers nums sorted in non-descending order and an integer k, return the number of distinct subarrays whose sum of elements is divisible by k.

A subarray is defined as a contiguous sequence of elements within an array. Two subarrays are distinct if the sequences of values they contain are not identical.

Constraints:

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

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

• nums is sorted in non-descending order.

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

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.