Time: 31 ms (80.95%), Space: 66.8 MB (29.52%) - LeetHub

Author: Sangram03

2915-count-of-interesting-subarrays/2915-count-of-interesting-subarrays.java

@@ -0,0 +1,14 @@
+class Solution {
+    public long countInterestingSubarrays(List<Integer> nums, int modulo, int k) {
+        Map<Integer, Integer> cnt = new HashMap<>();
+        cnt.put(0, 1);
+        long res = 0;
+        int prefix = 0;
+        for (int num : nums) {
+            if (num % modulo == k) prefix++;
+            res += cnt.getOrDefault((prefix - k + modulo) % modulo, 0);
+            cnt.put(prefix % modulo, cnt.getOrDefault(prefix % modulo, 0) + 1);
+        }
+        return res;
+    }
+}