Suppose we have an array nums and a value k. We have to find number of consecutive subsequences whose sum is divisible by k.
So, if the input is like k = 3 nums = [1,2,3,4,1], then the output will be 4 because the subsequences are , [1,2], [1,2,3] and [2,3,4].
To solve this, we will follow these steps −
Let us see the following implementation to get better understanding −
def solve(k, nums): x = *k x = 1 r=s=0 for elem in nums: s = (s+elem) % k r += x[s] x[s] += 1 return r k = 3 nums = [1,2,3,4,1] print(solve(k, nums))