Leetcode 523. Continuous Subarray Sum

Check whether any contiguous subarray of length ≥ 2 has a sum that's a multiple of k. This reduces to using prefix-sum modulo k and detecting repeated remainders (with index distance ≥ 2) to prove a subarray sum divisible by k.