mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 08:16:50 +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>
38 lines
1.0 KiB
JavaScript
38 lines
1.0 KiB
JavaScript
/**
|
|
* @function maxCharacter
|
|
* @example - Given a string of characters, return the character that appears the most often. Example: input = "Hello World!" return "l"
|
|
* @param {string} str
|
|
* @param {RegExp} ignorePattern - ignore the char in str that is not required
|
|
* @returns {string} - char
|
|
*/
|
|
const maxCharacter = (str, ignorePattern) => {
|
|
// initially it's count only alphabets
|
|
if (typeof str !== 'string') {
|
|
throw new TypeError('Argument should be a string')
|
|
} else if (!str) {
|
|
throw new Error('The param should be a nonempty string')
|
|
}
|
|
|
|
// store all char in occurrence map
|
|
const occurrenceMap = new Map()
|
|
|
|
for (const char of str) {
|
|
if (!ignorePattern?.test(char)) {
|
|
occurrenceMap.set(char, occurrenceMap.get(char) + 1 || 1)
|
|
}
|
|
}
|
|
|
|
// find the max char from the occurrence map
|
|
let max = { char: '', occur: -Infinity }
|
|
|
|
for (const [char, occur] of occurrenceMap) {
|
|
if (occur > max.occur) {
|
|
max = { char, occur }
|
|
}
|
|
}
|
|
|
|
return max.char
|
|
}
|
|
|
|
export default maxCharacter
|