Leetcode 974. Subarray Sums Divisible by K

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.