-
Notifications
You must be signed in to change notification settings - Fork 37.7k
/
Copy pathpermutations-solution.spec.js
60 lines (59 loc) · 1.47 KB
/
permutations-solution.spec.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
const permutations = require("./permutations-solution");
describe("permutations", () => {
test("1 possible permutation for a set containing 0 numbers", () => {
expect(permutations([])).toEqual([[]]);
});
test("1 possible permutation for a set containing 1 number", () => {
expect(permutations([1])).toEqual([[1]]);
});
test("2 possible permutations for a set containing 2 numbers", () => {
expect(permutations([1, 2]).sort()).toEqual(
[
[1, 2],
[2, 1],
].sort(),
);
});
test("6 possible permutations for a set containing 3 numbers", () => {
expect(permutations([1, 2, 3]).sort()).toEqual(
[
[1, 2, 3],
[1, 3, 2],
[2, 1, 3],
[2, 3, 1],
[3, 1, 2],
[3, 2, 1],
].sort(),
);
});
test("24 possible permutations for a set containing 4 numbers", () => {
expect(permutations([1, 2, 3, 4]).sort()).toEqual(
[
[1, 2, 3, 4],
[1, 2, 4, 3],
[1, 3, 2, 4],
[1, 3, 4, 2],
[1, 4, 2, 3],
[1, 4, 3, 2],
[2, 1, 3, 4],
[2, 1, 4, 3],
[2, 3, 1, 4],
[2, 3, 4, 1],
[2, 4, 1, 3],
[2, 4, 3, 1],
[3, 1, 2, 4],
[3, 1, 4, 2],
[3, 2, 1, 4],
[3, 2, 4, 1],
[3, 4, 1, 2],
[3, 4, 2, 1],
[4, 1, 2, 3],
[4, 1, 3, 2],
[4, 2, 1, 3],
[4, 2, 3, 1],
[4, 3, 1, 2],
[4, 3, 2, 1],
].sort(),
);
});
});