forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'neetcode-gh:main' into main
- Loading branch information
Showing
3 changed files
with
40 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,20 @@ | ||
| //We are basically storing sum%k and storing it in the hashmap and checking it. | ||
| //Math logic is that the overall sum will get cancelled out because of modulo | ||
|
|
||
| class Solution { | ||
| public boolean checkSubarraySum(int[] nums, int k) { | ||
| HashMap<Integer, Integer> map = new HashMap<>(); | ||
| map.put(0, -1); | ||
| int sum = 0; | ||
| for (int i = 0; i<nums.length; i++) { | ||
| sum += nums[i]; | ||
| int rem = sum%k; | ||
| if (map.containsKey(rem)) | ||
| if (i - map.get(rem)>=2) | ||
| return true; | ||
| if (!map.containsKey(rem)) | ||
| map.put(rem, i); | ||
| } | ||
| return false; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,18 @@ | ||
| #We are basically storing sum%k and storing it in the hashmap and checking it. | ||
| #Math logic is that the overall sum will get cancelled out because of modulo | ||
|
|
||
| class Solution: | ||
| def checkSubarraySum(self, nums: List[int], k: int) -> bool: | ||
| hashmap = {} | ||
| hashmap[0]=-1 | ||
| summ=0 | ||
| for i,j in enumerate(nums): | ||
| summ+=j | ||
| if summ%k in hashmap.keys(): | ||
| if i-hashmap[summ%k]>=2: | ||
| return True | ||
| else: | ||
| continue | ||
| hashmap[summ%k]=i | ||
| return False | ||
|
|