Subarray Sum Divisible by K
Prefix Sum
Subarray Sum Divisible by K
Given an array of integers and an integer K, find the number of subarrays which are divisible by K.
Input: [3,1,2,5,1], 3
Output: 6
Explanation: the six subarrays are[3], [3,1,2], [1,2],[5,1], [3,1,2,5,1,], [1,2,5,1]
Try it yourself
Title
Script
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.
Contrary to popular belief, Lorem Ipsum is not simply random text.
1 >>> a = [1, 2, 3] 2 >>> a[-1] 3 3