mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-20 02:23:24 +08:00
36dcff8c5d
* feat: New String Algorithm for LengthofLongestSubstringWithoutRepeatingCharacters * Fixed Errors and Mistakes in New Algorithm LengthofLongestSubstringWithoutRepetition * fix:#1389 Errors Fixed * fix:#1389 Syntax and Code Errors Fixed * fix:#1389 Errors FIxed * Fixed All new errors * fix:1389 Implemented suggestions and corrections * Use @see annotation --------- Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
27 lines
1.0 KiB
JavaScript
27 lines
1.0 KiB
JavaScript
import { lengthOfLongestSubstring } from '../LengthofLongestSubstringWithoutRepetition'
|
|
|
|
describe('LengthOfLongestSubstring', () => {
|
|
it('should throw error if parameter is not string', () => {
|
|
expect(() => lengthOfLongestSubstring(345)).toThrowError(TypeError)
|
|
expect(() => lengthOfLongestSubstring(true)).toThrowError(TypeError)
|
|
expect(() => lengthOfLongestSubstring(null)).toThrowError(TypeError)
|
|
})
|
|
|
|
it('should check substrings containing unique characters', () => {
|
|
expect(lengthOfLongestSubstring('abcabcbb')).toBe(3)
|
|
expect(lengthOfLongestSubstring('bbbbb')).toBe(1)
|
|
expect(lengthOfLongestSubstring('pwwkew')).toBe(3)
|
|
expect(lengthOfLongestSubstring(' ')).toBe(1)
|
|
expect(lengthOfLongestSubstring('abcdefghijklmnaaaaa')).toBe(13)
|
|
})
|
|
|
|
it('should give zero for empty strings', () => {
|
|
expect(lengthOfLongestSubstring('')).toBe(0)
|
|
})
|
|
|
|
it('should be case-sensitive', () => {
|
|
expect(lengthOfLongestSubstring('AaBbCc')).toBe(3)
|
|
expect(lengthOfLongestSubstring('AbCdEf')).toBe(6)
|
|
})
|
|
})
|