-
-
Couldn't load subscription status.
- Fork 5.8k
feat: New String Algorithm for LengthofLongestSubstringWithoutRepeati… #1389
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
Merged
Changes from 6 commits
Commits
Show all changes
8 commits Select commit Hold shift + click to select a range
f5d4585 feat: New String Algorithm for LengthofLongestSubstringWithoutRepeati…
Abhijit-033 d9c7e90 Fixed Errors and Mistakes in New Algorithm LengthofLongestSubstringWi…
Abhijit-033 7873099 fix:#1389 Errors Fixed
Abhijit-033 5e051dd fix:#1389 Syntax and Code Errors Fixed
Abhijit-033 b4d9d1d fix:#1389 Errors FIxed
Abhijit-033 1872f66 Fixed All new errors
Abhijit-033 403bc14 fix:1389 Implemented suggestions and corrections
Abhijit-033 2eabe73 Use @see annotation
appgurueu 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,27 @@ | ||
| /** | ||
| * @function lengthOfLongestSubstring | ||
| * @description Finds the length of the longest substring in a given string without repeating characters | ||
| * @param {String} str - The input string | ||
| * @returns {Number} The Length of the longest substring in a given string without repeating characters | ||
| * @example lower("abcabcbb") => 3 | ||
raklaptudirm marked this conversation as resolved. Outdated Show resolved Hide resolved | ||
| * @example lower("bbbbb") => 1 | ||
| */ | ||
| | ||
| const lengthOfLongestSubstring = (s) => { | ||
appgurueu marked this conversation as resolved. Show resolved Hide resolved | ||
| if (typeof s !== 'string') { | ||
| throw new TypeError('Invalid Input Type') | ||
| } | ||
| let maxLength = 0 | ||
| let start = 0 | ||
| const charMap = new Map() | ||
| for (let end = 0; end < s.length; end++) { | ||
| if (charMap.has(s[end])) { | ||
| start = Math.max(start, charMap.get(s[end]) + 1) | ||
| } | ||
| charMap.set(s[end], end) | ||
| maxLength = Math.max(maxLength, end - start + 1) | ||
| } | ||
| return maxLength | ||
| } | ||
| | ||
| export { lengthOfLongestSubstring } | ||
32 changes: 32 additions & 0 deletions 32 String/test/LengthofLongestSubstringWithoutRepetition.test.js
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,32 @@ | ||
| import { lengthOfLongestSubstring } from '../LengthofLongestSubstringWithoutRepetition' | ||
| | ||
| describe('Testing the lengthOfLongestSubstring function', () => { | ||
appgurueu marked this conversation as resolved. Outdated Show resolved Hide resolved | ||
| it('Test 1: Check by invalid type', () => { | ||
| expect(() => lengthOfLongestSubstring(345)).toThrowError(TypeError) | ||
| expect(() => lengthOfLongestSubstring(true)).toThrowError(TypeError) | ||
| expect(() => lengthOfLongestSubstring(null)).toThrowError(TypeError) | ||
| }) | ||
| | ||
| it('Test 2: Check with strings containing unique characters', () => { | ||
| expect(lengthOfLongestSubstring('abcabcbb')).toBe(3) | ||
| expect(lengthOfLongestSubstring('bbbbb')).toBe(1) | ||
| expect(lengthOfLongestSubstring('pwwkew')).toBe(3) | ||
| }) | ||
| | ||
| it('Test 3: Check with empty string', () => { | ||
| expect(lengthOfLongestSubstring('')).toBe(0) | ||
| }) | ||
| | ||
| it('Test 4: Check with string containing a single space', () => { | ||
| expect(lengthOfLongestSubstring(' ')).toBe(1) | ||
| }) | ||
| | ||
| it('Test 5: Check with mixed case string', () => { | ||
| expect(lengthOfLongestSubstring('AaBbCc')).toBe(3) | ||
| expect(lengthOfLongestSubstring('AbCdEf')).toBe(6) | ||
| }) | ||
| | ||
| it('Test 6: Check with long string with repeating characters', () => { | ||
| expect(lengthOfLongestSubstring('abcdefghijklmnaaaaa')).toBe(13) | ||
| }) | ||
| }) | ||
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.
Uh oh!
There was an error while loading. Please reload this page.