mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-12-19 06:58:15 +08:00
* feat: improved memoize function
used Map instead of object & used the JSON.stringfy method for generate a valid string as a key
* docs: modified documentation
* style: format with standard
* docs: modified stringify doc
* refactor: remove two repetition implementation
* feat: added validation, test codes
* chore: remove useless words
* feat: added types for jest
* chore: added link box
* feat: added new validation test casses & methods
* style: formated with standard
* feat: added parse method & test cases
* docs: added js docs
* chore: added default import export
* feat: imporved algorithm via replace method
* test: added two test cases
* feat: added jest type for suggestions
* feat: added `reduceRight` & `trim` method
* chore: added helper variable
* feat: added new rotation option
* Revert "chore: added helper variable"
This reverts commit 489544da0a.
* remove: yarn lock
* chore: fix grammer
* feat: used replace method & added test case
* feat: remove revert
* chore: added new line
* feat: added filter for alphabets only
* resolve: added empty validation improved ignore pattern
* chore: reverted to for of loop
37 lines
1.0 KiB
JavaScript
37 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
|