Package g3301_3400.s3381_maximum_subarray_sum_with_length_divisible_by_k

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3381 - Maximum Subarray Sum With Length Divisible by K.

    Medium

    You are given an array of integers nums and an integer k.

    Return the maximum sum of a non-empty subarray of nums, such that the size of the subarray is divisible by k.

    A subarray is a contiguous non-empty sequence of elements within an array.

    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 subarray is [-1, -2, -3, -4] which has length equal to 4 which is divisible by 4.

    Example 3:

    Input: nums = -5,1,2,-3,4, k = 2

    Output: 4

    Explanation:

    The maximum sum subarray is [1, 2, -3, 4] which has length equal to 4 which is divisible by 2.

    Constraints:

    • <code>1 <= k <= nums.length <= 2 * 10<sup>5</sup></code>

    • <code>-10<sup>9</sup><= numsi<= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long maxSubarraySum(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait