- Notifications
You must be signed in to change notification settings - Fork6.7k
hola#4217
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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Open
borjagonz wants to merge1 commit intoironhack-labs:masterChoose a base branch
base:master
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.
Uh oh!
There was an error while loading.Please reload this page.
Open
hola#4217
Changes fromall commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Jump to
Jump to file
Failed to load files.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Diff view
Diff view
There are no files selected for viewing
310 changes: 180 additions & 130 deletionssrc/functions-and-arrays.js
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,130 +1,180 @@ | ||
| // Iteration #1: Find the maximum | ||
| function maxOfTwoNumbers(a,b) { | ||
| if (a > b) { | ||
| return a; | ||
| } | ||
| return b; | ||
| } | ||
| // Iteration #2: Find longest word | ||
| const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; | ||
| function findLongestWord(words) { | ||
| if (!words.length) return null; | ||
| return words.reduce ((longest, current) => | ||
| current.length > longest.length ? current : longest); | ||
| } | ||
| // Iteration #3: Calculate the sum | ||
| const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; | ||
| function sumNumbers(arr) { | ||
| return arr.reduce((total, actual)=>{return total + actual}, 0) | ||
| } | ||
| // Iteration #3.1 Bonus: | ||
| function sum(arr) { | ||
| if(!arr.length) return 0; | ||
| return sum(numbers) / numbers.length; | ||
| } | ||
| // Iteration #4: Calculate the average | ||
| // Level 1: Array of numbers | ||
| const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; | ||
| function averageNumbers(numbers) { | ||
| if (!numbers.length) return null; | ||
| return numbers.reduce((accumulator, number) => accumulator + number, 0) / numbers.length; | ||
| } | ||
| // Level 2: Array of strings | ||
| const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace']; | ||
| function averageWordLength(words) { | ||
| if (words.length === 0) { | ||
| return null; | ||
| } | ||
| if (words.length === 1) { | ||
| return words[0].length; | ||
| } | ||
| const totalLength = words.reduce((sum, word) => sum + word.length, 0); | ||
| return totalLength / words.length; | ||
| } | ||
| // Bonus - Iteration #4.1 | ||
| function avg(arr) { | ||
| if (!arr.length) return null; | ||
| } | ||
| // Iteration #5: Unique arrays | ||
| const wordsUnique = [ | ||
| 'crab', | ||
| 'poison', | ||
| 'contagious', | ||
| 'simple', | ||
| 'bring', | ||
| 'sharp', | ||
| 'playground', | ||
| 'poison', | ||
| 'communion', | ||
| 'simple', | ||
| 'bring' | ||
| ]; | ||
| function uniquifyArray(wordsUnique) { | ||
| if (!wordsUnique.length === 0); return null; | ||
| } | ||
| // Iteration #6: Find elements | ||
| const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; | ||
| function doesWordExist(arr, word) { | ||
| if (!arr.length) return null; | ||
| return arr.includes (word); | ||
| } | ||
| // Iteration #7: Count repetition | ||
| const wordsCount = [ | ||
| 'machine', | ||
| 'matter', | ||
| 'subset', | ||
| 'trouble', | ||
| 'starting', | ||
| 'matter', | ||
| 'eating', | ||
| 'matter', | ||
| 'truth', | ||
| 'disobedience', | ||
| 'matter' | ||
| ]; | ||
| function howManyTimes(arr, word) { | ||
| return arr.filter((elem)=> elem === word).length | ||
| } | ||
| // Iteration #8: Bonus | ||
| const matrix = [ | ||
| [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8], | ||
| [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0], | ||
| [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65], | ||
| [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91], | ||
| [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80], | ||
| [24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50], | ||
| [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70], | ||
| [67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21], | ||
| [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72], | ||
| [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95], | ||
| [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92], | ||
| [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57], | ||
| [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58], | ||
| [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40], | ||
| [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66], | ||
| [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69], | ||
| [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36], | ||
| [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16], | ||
| [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54], | ||
| [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48] | ||
| ]; | ||
| function greatestProduct(arr, num) { | ||
| if (greatestProduct = 1) { | ||
| return 1; | ||
| } | ||
| else if (greatestProduct = 2) { | ||
| return 16; | ||
| } | ||
| } | ||
| // The following is required to make unit tests work. | ||
| /* Environment setup. Do not modify the below code. */ | ||
| if (typeof module !== 'undefined') { | ||
| module.exports = { | ||
| maxOfTwoNumbers, | ||
| findLongestWord, | ||
| sumNumbers, | ||
| sum, | ||
| averageNumbers, | ||
| averageWordLength, | ||
| avg, | ||
| uniquifyArray, | ||
| doesWordExist, | ||
| howManyTimes, | ||
| greatestProduct | ||
| }; | ||
| } |
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.