Repository navigation
London | 26-Jul_SDC | Roman Sanaye | Sprint 1 | Analyse and Refactor Functions - #238
Open
RomanSanaye wants to merge 5 commits into
Open
RomanSanaye wants to merge 5 commits into
RomanSanaye wants to merge 5 commits into
Conversation
cjyuan
reviewed
Oct 11, 2026
cjyuan
left a comment
There was a problem hiding this comment.
Analyses and code are good.
Could you ensure all code are consistently formatted?
Author
|
Hi @cjyuan , |
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
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.
Learners, PR Template
Self checklist
Task code
CYF-1173
Changelist
Analysed and refactored the JavaScript functions in Sprint 1 to reduce their complexity, and documented the complexity before and after in each docblock:
calculateSumAndProduct: merged two loops into one. Still O(n) time, O(1) space.findCommonItems: replacedincludesinsidefilterwith aSetlookup. Time O(n × m) to O(n + m).hasPairWithSum: replaced nested loops with a Set of visited numbers. Time O(n²) to O(n).removeDuplicates: replaced nested loops with[...new Set(inputSequence)]. Time O(n²) to O(n).