Skip to content

Simon Björkberg WDPT-MAR23 #3698

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.

Sign up for GitHub

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
wants to merge 10 commits into
base: master
Choose a base branch
from
Open

Simon Björkberg WDPT-MAR23 #3698

Changes from 1 commit
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
0b90e63
Finished Iteration 1, 2, 3, 3.2 (Not the last error task)
SimonBjorkberg Mar 28, 2023
37c4c47
Finished all 'Iteration 4' including bonuses
SimonBjorkberg Mar 28, 2023
2ebe922
fixed iteration 5
SimonBjorkberg Mar 28, 2023
dc8f73d
completed iteration 7
SimonBjorkberg Mar 28, 2023
80b52d6
last commit was iteration 6, now I added iteration 7
SimonBjorkberg Mar 28, 2023
c1d8fb4
Fixed the damn error
SimonBjorkberg Mar 28, 2023
9ea5776
Cleaned up the Sum function to make it look better
SimonBjorkberg Mar 29, 2023
1e67a49
Cleaned the sum function up further
SimonBjorkberg Mar 29, 2023
0bc2579
changed a few variables to make it look better
SimonBjorkberg Mar 29, 2023
3004991
changed for loops to forEach loops
SimonBjorkberg Mar 29, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
fixed iteration 5
  • Loading branch information
@SimonBjorkberg
SimonBjorkberg committed Mar 28, 2023
commit 2ebe9220bd496a19fb32a40e9b9b8d5d09a13fe6
18 changes: 16 additions & 2 deletions src/functions-and-arrays.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -142,8 +142,22 @@ const wordsUnique = [
'bring'
];

function uniquifyArray() {}

function uniquifyArray(words) {
if (words.length === 0) {
return null;
}
let newArray = [];
for (let i = 0; i < words.length; i++) {
if (newArray.includes(words[i])) {
continue;
}
else {
newArray.push(words[i]);
}
}
return newArray;
}
uniquifyArray(wordsUnique)


// Iteration #6: Find elements
Expand Down