Count of Interesting Subarrays

Problem You are given an integer array nums indexed from 0, along with integers modulo and k. For any range nums[l..r], let cnt represent how many positions i in that range satisfy: The range is considered interesting exactly when: Determine the total number of interesting subarrays. Input Format Output Format Print a single integer representing the number of interesting subarrays. Example Input: Output: Explanation: The positions with nums[i] % 4 == 1 are only index 0…