mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
308b022b03
* new algorithm 'Sliding-Window' added with example 'Longest Substring Without Repeating Characters' * new example of sliding window 'Permutation in String' added * chore: add `ignore_words_list` * sliding-window moved into Dynamic-programming directory Co-authored-by: Rak Laptudirm <raklaptudirm@gmail.com>
11 lines
448 B
JavaScript
11 lines
448 B
JavaScript
import { PermutationinString } from '../PermutationinString.js'
|
|
|
|
describe('PermutationinString', () => {
|
|
it("should return true if one of s1's permutations is the substring of s2", () => {
|
|
expect(PermutationinString('ab', 'eidbaooo')).toEqual(true)
|
|
expect(PermutationinString('abc', 'bcab')).toEqual(true)
|
|
expect(PermutationinString('ab', 'eidboaoo')).toEqual(false)
|
|
expect(PermutationinString('abc', '')).toEqual(false)
|
|
})
|
|
})
|