mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 16:26:47 +08:00
merge: Fix spellings (#821)
* chore: remove codespell from ci * feat: add codespell workflow * fix: codespell workflow * fix: ignore spellings in directory * chore: fix spellings ./Dynamic-Programming/KadaneAlgo.js:2: contiguos ==> contiguous ./Dynamic-Programming/KadaneAlgo.js:14: posible ==> possible * chore: fix spelling ./Dynamic-Programming/SieveOfEratosthenes.js:4: upto ==> up to * chore: fix spellings ./Dynamic-Programming/MaxNonAdjacentSum.js:22: Exmaple ==> Example * chore: fix spelling ./Project-Euler/test/Problem010.test.js:4: upto ==> up to ./Project-Euler/test/Problem010.test.js:8: upto ==> up to ./Project-Euler/test/Problem010.test.js:12: upto ==> up to * chore: fix spelling ./String/AlphaNumericPalindrome.js:10: recieves ==> receives ./String/AlphaNumericPalindrome.js:10: sting ==> string ./String/AlphaNumericPalindrome.js:46: varaible ==> variable * chore: fix spelling ./String/DiceCoefficient.js:3: stings ==> strings * chore: fix spelling ./String/test/DiceCoefficient.test.js:9: atleast ==> at least * chore: fix spelling ./String/test/MaxWord.test.js:8: ba ==> be * chore: ignore `PermutateString.test.js` * chore: fix spelling ./String/test/CheckVowels.test.js:62: occurances ==> occurrences * chore: ignore `SubsequenceRecursive.js` * chore: fix spelling ./Conversions/TemperatureConversion.js:2: arguement ==> argument * chore: fix spelling ./Conversions/RailwayTimeConversion.js:7: Formate ==> Format ./Conversions/RailwayTimeConversion.js:8: Formate ==> Format * chore: remove Linear Algebra The deleted directory hosted a package which are not accepted by this repository. * Auto-update DIRECTORY.md * chore: fix spelling * chore: fix spellings * merge: Created composite Simpson's integration method. Tests included. (#819) * Created composite Simpson's integration method.Tests included * Minor corrections * Auto-update DIRECTORY.md * Styled with standard.js * chore: remove blank line * chore: remove blank line Co-authored-by: ggkogkou <ggkogkou@ggkogkou.gr> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Rak Laptudirm <raklaptudirm@gmail.com> * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: remove codespell from ci * feat: add codespell workflow * fix: codespell workflow * fix: ignore spellings in directory * chore: fix spellings ./Dynamic-Programming/KadaneAlgo.js:2: contiguos ==> contiguous ./Dynamic-Programming/KadaneAlgo.js:14: posible ==> possible * chore: fix spelling ./Dynamic-Programming/SieveOfEratosthenes.js:4: upto ==> up to * chore: fix spellings ./Dynamic-Programming/MaxNonAdjacentSum.js:22: Exmaple ==> Example * chore: fix spelling ./Project-Euler/test/Problem010.test.js:4: upto ==> up to ./Project-Euler/test/Problem010.test.js:8: upto ==> up to ./Project-Euler/test/Problem010.test.js:12: upto ==> up to * chore: fix spelling ./String/AlphaNumericPalindrome.js:10: recieves ==> receives ./String/AlphaNumericPalindrome.js:10: sting ==> string ./String/AlphaNumericPalindrome.js:46: varaible ==> variable * chore: fix spelling ./String/DiceCoefficient.js:3: stings ==> strings * chore: fix spelling ./String/test/DiceCoefficient.test.js:9: atleast ==> at least * chore: fix spelling ./String/test/MaxWord.test.js:8: ba ==> be * chore: ignore `PermutateString.test.js` * chore: fix spelling ./String/test/CheckVowels.test.js:62: occurances ==> occurrences * chore: ignore `SubsequenceRecursive.js` * chore: fix spelling ./Conversions/TemperatureConversion.js:2: arguement ==> argument * chore: fix spelling ./Conversions/RailwayTimeConversion.js:7: Formate ==> Format ./Conversions/RailwayTimeConversion.js:8: Formate ==> Format * chore: remove Linear Algebra The deleted directory hosted a package which are not accepted by this repository. * Auto-update DIRECTORY.md * chore: fix spelling * chore: fix spellings * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: fix spelling * chore: no need to check filenames Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: ggkogkou <76820848+ggkogkou@users.noreply.github.com> Co-authored-by: ggkogkou <ggkogkou@ggkogkou.gr>
This commit is contained in:
Rak Laptudirm
@ -7,7 +7,7 @@
|
||||
/*****************************************************************************
|
||||
* What is a palindrome? https://en.wikipedia.org/wiki/Palindrome
|
||||
*
|
||||
* The function alphaNumericPlaindrome() recieves a sting with varying formats
|
||||
* The function alphaNumericPlaindrome() receives a string with varying formats
|
||||
* like "racecar", "RaceCar", and "race CAR"
|
||||
* The string can also have special characters
|
||||
* like "2A3*3a2", "2A3 3a2", and "2_A3*3#A2"
|
||||
@ -43,7 +43,7 @@ const alphaNumericPlaindrome = (str) => {
|
||||
// iterate through the arr and check the condition of palindrome
|
||||
for (let i = 0; i < arr.length; i++) {
|
||||
if (arr[i] !== arrRev[arr.length - 1 - i]) {
|
||||
// if the string is not palindrome then we change palin varaible to 1
|
||||
// if the string is not palindrome then we change palin variable to 1
|
||||
palin = 1
|
||||
}
|
||||
}
|
||||
|
||||
@ -1,6 +1,6 @@
|
||||
/* The Sørensen–Dice coefficient is a statistic used to gauge the similarity of two samples.
|
||||
* Applied to strings, it can give you a value between 0 and 1 (included) which tells you how similar they are.
|
||||
* Dice coefficient is calculated by comparing the bigrams of both stings,
|
||||
* Dice coefficient is calculated by comparing the bigrams of both strings,
|
||||
* a bigram is a substring of the string of length 2.
|
||||
* read more: https://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient
|
||||
*/
|
||||
|
||||
@ -59,7 +59,7 @@ describe('Test the checkVowels function', () => {
|
||||
expect(countVowels).toBe(0)
|
||||
})
|
||||
|
||||
it('should count multiple occurances of the same vowel in the input', () => {
|
||||
it('should count multiple occurrences of the same vowel in the input', () => {
|
||||
const value = 'aaaaa'
|
||||
const countVowels = checkVowels(value)
|
||||
expect(countVowels).toBe(5)
|
||||
|
||||
@ -6,7 +6,7 @@ describe('diceCoefficient', () => {
|
||||
expect(diceCoefficient('abc', 'abc')).toBe(1)
|
||||
expect(diceCoefficient('', '')).toBe(1)
|
||||
|
||||
// string length needs to be atleast 2 (unless equal)
|
||||
// string length needs to be at least 2 (unless equal)
|
||||
expect(diceCoefficient('a', '')).toBe(0)
|
||||
expect(diceCoefficient('', 'a')).toBe(0)
|
||||
|
||||
|
||||
@ -5,8 +5,8 @@ describe('Testing the maxWord function', () => {
|
||||
expect(() => maxWord(10)).toThrow()
|
||||
})
|
||||
it('get the max word', () => {
|
||||
const string = 'ba ba ba ba banana'
|
||||
const string = 'be be be be a a banana'
|
||||
const mostOccurringWord = maxWord(string)
|
||||
expect(mostOccurringWord).toBe('ba')
|
||||
expect(mostOccurringWord).toBe('be')
|
||||
})
|
||||
})
|
||||
|
||||
Reference in New Issue
Block a user