aboutsummaryrefslogtreecommitdiff
path: root/count_interest_subarr.c
diff options
context:
space:
mode:
Diffstat (limited to 'count_interest_subarr.c')
-rw-r--r--count_interest_subarr.c22
1 files changed, 22 insertions, 0 deletions
diff --git a/count_interest_subarr.c b/count_interest_subarr.c
new file mode 100644
index 0000000..bcea6ca
--- /dev/null
+++ b/count_interest_subarr.c
@@ -0,0 +1,22 @@
+// 2845. Count of Interesting Subarrays
+#include <stdio.h>
+#include <stdlib.h>
+
+/*
+ * given a 0-indexed integer array 'nums' an integer 'modulo' and an integer
+ * 'k'. your task is to find the count of subarrays that are interesting. a
+ * subarray 'nums[l...r]' is interesting if the following condition holds: let
+ * 'cnt' be the number of indices 'i' in the range '[l, r]' such that 'nums[i]
+ * % modulo == k'. then 'cnt % modulo == k'. return an integer denoting thecount
+ * of interesting subarrays. note a subarray is contiguous non-empty sequence of
+ * elements within an array.
+ */
+
+long long countInterestingSubarrays(int *nums, int nums_size, int modulo,
+ int k) {}
+
+int main() {
+ int n1[] = {3, 2, 4}, n2[] = {3, 1, 9, 6};
+ printf("%lld\n", countInterestingSubarrays(n1, 3, 2, 1)); // expect: 3
+ printf("%lld\n", countInterestingSubarrays(n2, 4, 3, 0)); // expect: 2
+}