Continuous Subarray Sum

You are given an integer array nums and an integer k, return true if nums has a good subarray or false otherwise.

A good subarray is a subarray where:

• its length is at least two, and
• the sum of the elements of the subarray is a multiple of k.

Note:

• A subarray is a contiguous part of the array.
• An integer x is a multiple of k if there exists an integer n such that x = n * k. 0 is always a multiple of k.

Example 1:

Input: nums = [23,2,4,6,7], k = 6

Output: true

Explanation: [2,4] is a continuous subarray of size 2 whose sum is 6.

Example 2:

Input: nums = [23,2,6,4,7], k = 6

Output: true

Explanation: [23,2,6,4,7] is an continuous subarray of size 5 whose sum is 42, which is a multiple of 6..

Example 3:

Input: nums = [23,2,6,4,7], k = 13

Output: false

Constraints:

• 1 <= nums.length <= 1,00,000
• 0 <= nums[i] <= 1,000,000,000
• 0 <= sum(nums) <= ((2^31)-1)
• 1 <= k <= ((2^31)-1)

Company Tags

Please upgrade to NeetCode Pro to view company tags.