mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 08:16:50 +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>
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(14)
|
|
})
|
|
|
|
it('should give zero for empty strings', () => {
|
|
expect(lengthOfLongestSubstring('')).toBe(0)
|
|
})
|
|
|
|
it('should be case-sensitive', () => {
|
|
expect(lengthOfLongestSubstring('AaBbCc')).toBe(6)
|
|
expect(lengthOfLongestSubstring('AbCdEf')).toBe(6)
|
|
})
|
|
})
|