Sync LeetCode submission Runtime - 40 ms (96.74%), Memory - 38.1 MB (12.61%)

Author: jimit105

0523-continuous-subarray-sum/solution.py

@@ -1,13 +1,13 @@
-# Approach 1: Prefix Sum and Hashing
+# Approach 1: Prefix sum and Hashing
 
 # Time: O(n)
 # Space: O(n)
 
 class Solution:
     def checkSubarraySum(self, nums: List[int], k: int) -> bool:
         prefix_mod = 0
-        mod_seen = {0: -1}
-        
+        mod_seen = {0 : -1}
+
         for i in range(len(nums)):
             prefix_mod = (prefix_mod + nums[i]) % k
 
@@ -20,3 +20,4 @@ def checkSubarraySum(self, nums: List[int], k: int) -> bool:
                 mod_seen[prefix_mod] = i
 
         return False
+