Available question text
Count the number of contiguous subarrays whose sum is divisible by k; this reduces to counting pairs of prefix sums with the same remainder modulo k, typically done by tracking frequencies of prefix-sum remainders to get an O(n) solution.
Related questions
Continue with questions that share topics or the same question type.
- Subarray Sum Equals K
Coding · Array · Hash Table · Prefix Sum
- Contiguous Array
Coding · Array · Hash Table · Prefix Sum
- Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
- Minimum Operations to Reduce X to Zero
Coding · Array · Binary Search · Hash Table
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 974. Subarray Sums Divisible by K
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
TikTok
Subarray Sums Divisible by K
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 52.7. This is not an interview probability.
View source