mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 16:26:47 +08:00
86d333ee94
* 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>
55 lines
2.0 KiB
JavaScript
55 lines
2.0 KiB
JavaScript
/**
|
|
* What is Pangram?
|
|
* Pangram is a sentence that contains all the letters in the alphabet https://en.wikipedia.org/wiki/Pangram
|
|
*/
|
|
|
|
/**
|
|
* @function checkPangramRegex
|
|
* @description - This function check pangram with the help of regex pattern
|
|
* @param {string} string
|
|
* @returns {boolean}
|
|
* @example - checkPangramRegex("'The quick brown fox jumps over the lazy dog' is a pangram") => true
|
|
* @example - checkPangramRegex('"Waltz, bad nymph, for quick jigs vex." is a pangram') => true
|
|
*/
|
|
const checkPangramRegex = (string) => {
|
|
if (typeof string !== 'string') {
|
|
throw new TypeError('The given value is not a string')
|
|
}
|
|
|
|
/**
|
|
* Match all 26 alphabets using regex, with the help of:
|
|
* Capturing group - () -> Groups multiple tokens together and creates a capture group for extracting a substring or using a backreference.
|
|
* Character set - [a-z] -> Matches a char in the range a to z in case-insensitive for the 'i' flag
|
|
* Negative lookahead - (?!) -> Specifies a group that can not match after the main expression (if it matches, the result is discarded).
|
|
* Dot - . -> Matches any character except linebreaks. Equivalent to
|
|
* Star - * -> Matches 0 or more of the preceding token.
|
|
* Numeric reference - \{$n} -> Matches the results of a capture group. E.g. - \1 matches the results of the first capture group & \3 matches the third.
|
|
*/
|
|
return string.match(/([a-z])(?!.*\1)/gi).length === 26
|
|
}
|
|
|
|
/**
|
|
* @function checkPangramSet
|
|
* @description - This function detect the pangram sentence by HashSet
|
|
* @param {string} string
|
|
* @returns {boolean}
|
|
*/
|
|
const checkPangramSet = (string) => {
|
|
if (typeof string !== 'string') {
|
|
throw new TypeError('The given value is not a string')
|
|
}
|
|
|
|
const lettersSet = new Set()
|
|
|
|
for (const letter of string.toUpperCase()) {
|
|
if (/[A-Z]/.test(letter)) {
|
|
// if the letter is a valid uppercase alphabet then the add method insert the letter to the HashSet
|
|
lettersSet.add(letter)
|
|
}
|
|
}
|
|
|
|
return lettersSet.size === 26
|
|
}
|
|
|
|
export { checkPangramRegex, checkPangramSet }
|