<pre><code class="lang-python">class Solution:
 def checkSubarraySum(self, nums: List[int], k: int) -&gt; bool:
 prefixSum = 0
 rem = {0: -1}

 for i, num in enumerate(nums):
 prefixSum += num
 m = prefixSum % k 
 if m in rem:
 if i - rem[m] &gt; 1:
 return True
 else:
 rem[m] = i
</code></pre>

```python
class Solution:
    def checkSubarraySum(self, nums: List[int], k: int) -> bool:
        prefixSum = 0
        rem = {0: -1}

        for i, num in enumerate(nums):
            prefixSum += num
            m = prefixSum % k 
            if m in rem:
                if i - rem[m] > 1:
                    return True
            else:
                rem[m] = i                    
```

523. Continuous Subarray Sum