-
-
Notifications
You must be signed in to change notification settings - Fork 325
London | 26-ITP-May | Ebrahim Moqbel | Sprint -1 | course work #1393
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
Ebrahim-Moqbel
wants to merge
5
commits into
CodeYourFuture:main
Choose a base branch
from
Ebrahim-Moqbel:coursework-sprint-1
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
5 commits
Select commit
Hold shift + click to select a range
c2e4f8f
fixed the median function upholding with the test requirements
Ebrahim-Moqbel d473e23
fixed the bug of the function for the last case of the test
Ebrahim-Moqbel 56d8237
committing the max function built from the max.test cases
Ebrahim-Moqbel 66bf485
implemented the dedupe and sum functions form the test cases files
Ebrahim-Moqbel 0b1b4e1
refactored the includes function
Ebrahim-Moqbel File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
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
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1 +1,12 @@ | ||
| function dedupe() {} | ||
| function dedupe(arr) { | ||
| // initialize an empty array | ||
| let dedupedArr =[]; | ||
| for( element of arr){ | ||
| if(!dedupedArr.includes(element)){ | ||
| dedupedArr.push(element); | ||
| } | ||
|
|
||
| } | ||
| return dedupedArr | ||
| } | ||
| module.exports = dedupe; |
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
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,4 +1,15 @@ | ||
| function findMax(elements) { | ||
| const numbersOnly = elements.filter((item)=> typeof item === 'number' && !Number.isNaN(item)); | ||
|
|
||
| if (numbersOnly.length ===0 ){ | ||
| return -Infinity | ||
| } | ||
| const sorted = [...numbersOnly].sort((a,b) => a-b) | ||
| const max = sorted[sorted.length-1] | ||
|
|
||
| return max | ||
|
|
||
|
|
||
| } | ||
|
|
||
| module.exports = findMax; | ||
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
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,4 +1,15 @@ | ||
| function sum(elements) { | ||
| //filter the array to be numerical values only | ||
| const numbersOnly = elements.filter((item)=> typeof item === 'number' && !Number.isNaN(item)); | ||
|
|
||
| if(numbersOnly.length === 0){ | ||
| return 0 | ||
| } | ||
| let total = 0 ; | ||
| for( let i = 0 ; i < numbersOnly.length; i ++ ){ | ||
| total += numbersOnly[i]; | ||
| } | ||
| return total ; | ||
| } | ||
|
|
||
| module.exports = sum; |
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
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -11,5 +11,6 @@ | |
| "license": "ISC", | ||
| "devDependencies": { | ||
| "jest": "^29.7.0" | ||
| } | ||
| }, | ||
| "type": "commonjs" | ||
| } | ||
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,13 +1,21 @@ | ||
| // Refactor the implementation of includes to use a for...of loop | ||
|
|
||
| function includes(list, target) { | ||
| for (let index = 0; index < list.length; index++) { | ||
| const element = list[index]; | ||
| if (element === target) { | ||
| return true; | ||
| // function includes(list, target) { | ||
| // for (let index = 0; index < list.length; index++) { | ||
| // const element = list[index]; | ||
| // if (element === target) { | ||
| // return true; | ||
| // } | ||
| // } | ||
| // return false; | ||
| // } | ||
| function includes(list, target){ | ||
| for (element of list){ | ||
| if(element === target){ | ||
| return true | ||
| } | ||
| } | ||
| return false; | ||
| return false | ||
| } | ||
|
|
||
| module.exports = includes; |
Oops, something went wrong.
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Good idea to use sorting