Continuous Subarray Sum LeetCode Solution

Problem Statement

Continuous Subarray Sum LeetCode Solution - Given an integer array nums and an integer k, return true if nums has a continuous subarray of the size of at least two whose elements sum up to a multiple of k, or false otherwise.

 

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 = , k = 6

 

Output:

true

 

Explanation:

is a continuous subarray of size 2 whose elements sum up to 6.

 

Example 2:

 

Input:

nums = , k = 6

 

Output:

true

 

Explanation:

is an continuous subarray of size 5 whose elements sum up to 42.

42 is a multiple of 6 because 42 = 7 * 6 and 7 is an integer.

 

Example 3:

 

Input:

nums = , k = 13

 

Output:

false

Constraints:

 

- 1

 

www.tutorialcup.com/leetcode-solutions/continuous-subarra...

Done