Continuous Subarray Sum LeetCode solution in Python

1
class Solution:
2
    def checkSubarraySum(self, nums: List[int], k: int) -> bool:
3
        psum = {0: -1}
4
        currentSum = 0
5
        for i in range(len(nums)):
6
            currentSum += nums[i]
7
            remainder = currentSum % k
8
            if remainder not in psum:
9
                psum[remainder] = i
10
            else:
11
                if i - psum[remainder] > 1:
12
                    return True
13
        return False