- Notifications
You must be signed in to change notification settings - Fork6.7k
[BER-WDFT-012023] aron seiffert#3504
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
Uh oh!
There was an error while loading.Please reload this page.
Conversation
matigobbi left a comment
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.
Nice work Aaron!
Keep working and learning 😁 🤓!
| } else if (words.length === 1) { | ||
| return words[0]; | ||
| } else { | ||
| return words.sort((a, b ) => b.length - a.length)[0]; |
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.
Thats smart, i think you can also use Math.max([...words]), and you will get same output
| function doesWordExist() {} | ||
| function doesWordExist(wordList, searchWord) { | ||
| return (wordList.length) ? wordList.includes(searchWord) : null; |
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.
nice use of turnery operator!
This pull request has been automatically marked as stale because it didn't have any recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
This pull request is closed. Thank you. |
Submission
lab-css-recipes-cloneThis pull request includes my submission for thelab-javascript-functions-and-arrays.
I am still working on iteration#8 – in German you would say it's a "harte nuss" 🌰 😅 . An updated pull request will follow soon.
-as