3381. Maximum Subarray Sum With Length Divisible by K

You are given an array of integers nums and an integer k. Return the maximum sum of a subarray of nums, such that the size of the subarray is divisible by k. Example 1: Input: nums = [1,2], k = 1 Output: 3 Explanation: The subarray [1, 2] with sum 3 has length equal to 2 which is divisible by 1. Example 2: Input: nums = [-1,-2,-3,-4,-5], k = 4 Output: -10 Explanation: The maximum sum