London | 25-SDC-Nov | Emiliano Uruena | Sprint 1 | Analyse and Refactor Functions#129
Open
Emilianouz wants to merge 8 commits into
Open
London | 25-SDC-Nov | Emiliano Uruena | Sprint 1 | Analyse and Refactor Functions#129Emilianouz wants to merge 8 commits into
Emilianouz wants to merge 8 commits into
Conversation
Emilianouz
added
📅 Sprint 1
cjyuan
reviewed
Mar 2, 2026
| * Optimal Time Complexity: | ||
| * Time Complexity: for each element in the input is compared against all previous unique elements: o(n2) | ||
| * Space Complexity: we store n elements it all elements are unique. | ||
| * Optimal Time Complexity: Each element is processed once O(1). |
There was a problem hiding this comment.
Can you elaborate how you derived the optimal time complexity of O(1)?
Comment on lines
+16
to
+18
| let i = 0; | ||
| i < inputSequence.length; | ||
| i++ |
Comment on lines
22
to
25
| if (!seenItems.has(value)) { | ||
| seenItems.add(value); | ||
| uniqueItems.push(value); | ||
| } |
There was a problem hiding this comment.
JS Set object preserves the order of which the elements are added to the set. So for better performance we could rely on its built-in ability to convert an array to a set and vice versa.
| Space Complexity: | ||
| space is constant O(1) | ||
| Optimal time complexity: | ||
| With only one loop for both operations reduce complexity to o(1) |
There was a problem hiding this comment.
The optimal time complexity refers to the complexity of the function, and it is not O(1).
cjyuan
added
Reviewed
Updated the optimal time complexity comment to reflect correct analysis.
Clarified optimal time complexity explanation in comments.
Clarified optimal time and space complexity in docstring.
Updated time and space complexity explanations in docstring.
Emilianouz
added
Needs Review
cjyuan
reviewed
Mar 4, 2026
| Time Complexity: | ||
| Space Complexity: | ||
| Optimal time complexity: | ||
| Time Complexity: The time complexity is O(n + m) because we build a set from the second sequence in O(m) time and iterate through the first sequence in O(n) time. |
There was a problem hiding this comment.
This seems like a complexity analysis for the refactored code. The original code does not use any set.
What's the complexity of the original code?
cjyuan
added
Reviewed
Refactor to combine sum and product calculations into a single loop, maintaining O(n) complexity.
Removed redundant complexity explanations in docstring.
Emilianouz
added
Needs Review
cjyuan
reviewed
May 17, 2026
Comment on lines
+12
to
+14
| Time Complexity: The time complexity is O(n + m) | ||
| Space Complexity: The space complexity is O(n + m) | ||
| Optimal time complexity: The time complexity is O(n + m) |
There was a problem hiding this comment.
What is the time complexity of the the original code?
Can you explan why your implementation has a space and time complexity of O(n+m)?
cjyuan
added
Reviewed
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Self checklist
Changelist
Refactor algorithms for improved efficiency and Complexity.