mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-06 01:18:23 +08:00

* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
45 lines
945 B
JavaScript
45 lines
945 B
JavaScript
// Given a sentence, return the most occurring word
|
|
|
|
/**
|
|
* @param {string} sentence - the sentence you want to find the most occurring word
|
|
* @returns {string} - the most occurring word
|
|
*
|
|
* @example
|
|
* - maxWord('lala lili lala'); // lala
|
|
*/
|
|
const maxWord = (sentence = '') => {
|
|
if (typeof sentence !== 'string') {
|
|
throw new TypeError('the param should be string')
|
|
}
|
|
|
|
if (!sentence) {
|
|
return null
|
|
}
|
|
|
|
const words = sentence.split(' ')
|
|
if (words.length < 2) {
|
|
return words[0]
|
|
}
|
|
|
|
const occurrences = {}
|
|
words.forEach((word) => {
|
|
occurrences[word.toLocaleLowerCase()] =
|
|
occurrences[word.toLocaleLowerCase()] + 1 || 1
|
|
})
|
|
|
|
const max = Object.keys(occurrences).reduce(
|
|
(n, word) => {
|
|
if (occurrences[word] > n.count) {
|
|
return { word, count: occurrences[word] }
|
|
} else {
|
|
return n
|
|
}
|
|
},
|
|
{ word: '', count: 0 }
|
|
)
|
|
|
|
return max.word
|
|
}
|
|
|
|
export { maxWord }
|