Subarray Sums Divisible by K:(https://leetcode.com/problems/subarray-sums-divisible-by-k/) Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k. A subarray is a contiguous part of an array. Example 1: Input: nums = [4,5,0,-2,-3,1], k = 5
Output: 7
Explanation: There are 7 subarrays…