-
-
Notifications
You must be signed in to change notification settings - Fork 5.7k
Add CheckExceeding function
#907
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
raklaptudirm
merged 3 commits into
TheAlgorithms:master
from
fahimfaisaal:check-exceeding
Mar 22, 2022
Merged
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,42 @@ | ||
| /** | ||
| * @function checkExceeding | ||
| * @description - Exceeding words are words where the gap between two adjacent characters is increasing. The gap is the distance in ascii | ||
| * @param {string} str | ||
| * @returns {boolean} | ||
| * @example - checkExceeding('delete') => true, ascii difference - [1, 7, 7, 15, 15] which is incremental | ||
| * @example - checkExceeding('update') => false, ascii difference - [5, 12, 3, 19, 15] which is not incremental | ||
| */ | ||
| const checkExceeding = (str) => { | ||
| if (typeof str !== 'string') { | ||
| throw new TypeError('Argument is not a string') | ||
| } | ||
|
|
||
| const upperChars = str | ||
| .toUpperCase() | ||
| .replace(/[^A-Z]/g, '') // remove all from str except A to Z alphabets | ||
|
|
||
| const adjacentDiffList = [] | ||
|
|
||
| for (let i = 0; i < upperChars.length - 1; i++) { | ||
| // destructuring current char & adjacent char by index, cause in javascript String is an object. | ||
| const { [i]: char, [i + 1]: adjacentChar } = upperChars | ||
|
|
||
| if (char !== adjacentChar) { | ||
| adjacentDiffList.push( | ||
| Math.abs(char.charCodeAt() - adjacentChar.charCodeAt()) | ||
raklaptudirm marked this conversation as resolved.
Show resolved
Hide resolved
|
||
| ) | ||
| } | ||
| } | ||
|
|
||
| for (let i = 0; i < adjacentDiffList.length - 1; i++) { | ||
| const { [i]: charDiff, [i + 1]: secondCharDiff } = adjacentDiffList | ||
|
|
||
| if (charDiff > secondCharDiff) { | ||
| return false | ||
| } | ||
| } | ||
|
|
||
| return true | ||
| } | ||
|
|
||
| export { checkExceeding } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,46 @@ | ||
| import { checkExceeding } from '../CheckExceeding' | ||
|
|
||
| describe('Testing CheckExceeding function', () => { | ||
| it('Testing the invalid types', () => { | ||
| expect(() => checkExceeding(Math.random())).toThrow('Argument is not a string') | ||
| expect(() => checkExceeding(null)).toThrow('Argument is not a string') | ||
| expect(() => checkExceeding(false)).toThrow('Argument is not a string') | ||
| expect(() => checkExceeding(false)).toThrow('Argument is not a string') | ||
| }) | ||
|
|
||
| it('Testing with empty string', () => { | ||
| expect(checkExceeding('')).toBe(true) | ||
| }) | ||
|
|
||
| it('Testing with linear alphabets', () => { | ||
| expect(checkExceeding('a b c d e ')).toBe(true) | ||
| expect(checkExceeding('f g h i j ')).toBe(true) | ||
| expect(checkExceeding('k l m n o ')).toBe(true) | ||
| expect(checkExceeding('p q r s t ')).toBe(true) | ||
| expect(checkExceeding('u v w x y z')).toBe(true) | ||
| }) | ||
|
|
||
| it('Testing not exceeding words', () => { | ||
| expect(checkExceeding('Hello')).toBe(false) | ||
| expect(checkExceeding('world')).toBe(false) | ||
| expect(checkExceeding('update')).toBe(false) | ||
| expect(checkExceeding('university')).toBe(false) | ||
| expect(checkExceeding('dog')).toBe(false) | ||
| expect(checkExceeding('exceeding')).toBe(false) | ||
| expect(checkExceeding('resolved')).toBe(false) | ||
| expect(checkExceeding('future')).toBe(false) | ||
| expect(checkExceeding('fixed')).toBe(false) | ||
| expect(checkExceeding('codes')).toBe(false) | ||
| expect(checkExceeding('facebook')).toBe(false) | ||
| expect(checkExceeding('vscode')).toBe(false) | ||
| }) | ||
|
|
||
| it('Testing exceeding words', () => { | ||
| expect(checkExceeding('bee')).toBe(true) // [ 3 ] | ||
| expect(checkExceeding('can')).toBe(true) // [ 2, 13 ] | ||
raklaptudirm marked this conversation as resolved.
Show resolved
Hide resolved
|
||
| expect(checkExceeding('good')).toBe(true) // [ 8, 11 ] | ||
| expect(checkExceeding('bad')).toBe(true) // [ 1, 3 ] | ||
| expect(checkExceeding('play')).toBe(true) // [ 4, 11, 24 ] | ||
| expect(checkExceeding('delete')).toBe(true) // [1, 7, 7, 15, 15] | ||
| }) | ||
| }) | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.