continuous-subarray-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an integer array nums and an integer k, return <code>true</code> if <code>nums</code> has a good subarray or <code>false</code> otherwise.

A good subarray is a subarray where:

<ul>
	<li>its length is at least two, and</li>
	<li>the sum of the elements of the subarray is a multiple of <code>k</code>.</li>
</ul>

Note that:

<ul>
	<li>A subarray is a contiguous part of the array.</li>
	<li>An integer <code>x</code> is a multiple of <code>k</code> if there exists an integer <code>n</code> such that <code>x = n * k</code>. <code>0</code> is always a multiple of <code>k</code>.</li>
</ul>

&nbsp;
Example 1:

<pre>
Input: nums = [23,2,4,6,7], k = 6
Output: true
Explanation: [2, 4] is a continuous subarray of size 2 whose elements sum up to 6.
</pre>

Example 2:

<pre>
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 elements sum up to 42.
42 is a multiple of 6 because 42 = 7 * 6 and 7 is an integer.
</pre>

Example 3:

<pre>
Input: nums = [23,2,6,4,7], k = 13
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>0 &lt;= sum(nums[i]) &lt;= 231 - 1</code></li>
	<li><code>1 &lt;= k &lt;= 231 - 1</code></li>
</ul>