Skip to content

[PTWDMIA102019] Erick Sicard #1276

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

Closed
wants to merge 11 commits into from
Closed

[PTWDMIA102019] Erick Sicard #1276

Changes from 1 commit
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
5a24fab
Iteration #1: Find the maximum
ericksicard Oct 28, 2019
45c8ded
Iteration #2: Find longest word
ericksicard Oct 29, 2019
614fe0d
Iteration #2: Find longest word - empty string
ericksicard Oct 29, 2019
38dbe04
Iteration #3: Calculate the sum
ericksicard Oct 29, 2019
c9fab13
Iteration #4: Calculate the average/Level 1: Array of numbers
ericksicard Oct 29, 2019
184b8b1
Iteration #4: Calculate the average/Level 2: Array of strings
ericksicard Oct 29, 2019
0f238c6
Iteration #5: Unique arrays
ericksicard Oct 29, 2019
ad1fa96
Iteration #6: Find elements
ericksicard Oct 29, 2019
f3c50dc
Iteration #7: Count repetition
ericksicard Oct 29, 2019
69e8e16
Iteration #8: Bonus - Horizontal, Vertical and Diagonal adjacents
Oct 29, 2019
18cffbc
Done
Oct 29, 2019
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
Prev Previous commit
Next Next commit
Iteration #2: Find longest word
  • Loading branch information
@ericksicard
ericksicard committed Oct 29, 2019
commit 45c8ded51592e32f8e93db02665522b3d2a7426a
10 changes: 10 additions & 0 deletions starter-code/src/functions-and-arrays.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,6 +6,16 @@ function maxOfTwoNumbers(num1, num2) {

// Iteration #2: Find longest word
const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
function findLongestWord(arr) {

//Simple local comprobation
console.log(arr.map( elm => ({[elm]: elm.length}) ))

let result = arr.
reduce( (acc, cur) => acc.length >= cur.length ? acc : acc = cur);

return result;
}

// Iteration #3: Calculate the sum

Expand Down