This repository was archived by the owner on Sep 7, 2025. It is now read-only.
Longest continious subset that adds up to zero #223
Merged
Conversation
This file contains hidden or 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
Given an array consisting of positive and negative integers, find the length of the longest continuous subset whose sum is zero. To be done in O(n) time complexity. The use of hash-maps helps bring down the complexity to O(n). Eg: Array size: 10 Array: 95 -97 -387 -435 -5 -70 897 127 23 284 Then the length longest continious subset/sequence which sums up to zero is 5 Since the longest continious subset which sums up to zero is -387 -435 -5 -70 897. This program makes use of hashmaps and the STL is unordered_map.
Given an integer array of size 2N + 1. In this given array, N numbers are present twice and one number is present only once in the array. You need to find and return that number which is unique in the array.
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
2 participants
Add this suggestion to a batch that can be applied as a single commit. This suggestion is invalid because no changes were made to the code. Suggestions cannot be applied while the pull request is closed. Suggestions cannot be applied while viewing a subset of changes. Only one suggestion per line can be applied in a batch. Add this suggestion to a batch that can be applied as a single commit. Applying suggestions on deleted lines is not supported. You must change the existing code in this line in order to create a valid suggestion. Outdated suggestions cannot be applied. This suggestion has been applied or marked resolved. Suggestions cannot be applied from pending reviews. Suggestions cannot be applied on multi-line comments. Suggestions cannot be applied while the pull request is queued to merge. Suggestion cannot be applied right now. Please check back later.
Given an array consisting of positive and negative integers, find the length of the longest continuous subset whose sum is zero.
To be done in O(n) time complexity. The use of hash-maps helps bring down the complexity to O(n).
Eg: Array size: 10
Array: 95 -97 -387 -435 -5 -70 897 127 23 284
Then the length longest continious subset/sequence which sums up to zero is 5
Since the longest continious subset which sums up to zero is -387 -435 -5 -70 897.
This program makes use of hashmaps and the STL is unordered_map.
This pull request is:
This pull request fixes:
Changes: