Subarrays divisible by k
Given an integer array nums and an integer k, return the number of contiguous non-empty subarrays whose element sum is divisible by k. The array may contain negative numbers. Here 1 <= len(nums) <= 3*10^4 and 2 <= k <= 10^4.
Implement
subarrays_div_by_k(nums: list[int], k: int) → intExamples
in
[[4,5,0,-2,-3,1],5]out7What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[[4,5,0,-2,-3,1],5]7not run yetsample