TheOdinProject · mao-sz · Dec 4, 2025 · Dec 1, 2025
diff --git a/13_factorial/README.md → 17_factorial/README.md b/13_factorial/README.md → 17_factorial/README.md
@@ -1,4 +1,4 @@
-# Exercise 13 - Factorial
+# Exercise 17 - Factorial
 
 Write a recursive [factorial](https://simple.wikipedia.org/wiki/Factorial) function that takes a non-negative integer, and returns the product of all positive integers less than or equal to the input integer. An input of `0` should return `1`. The function should only accept numbers, so `'4'` should not be accepted as it is a string. All invalid inputs should return `undefined`.
 

diff --git a/13_factorial/factorial.js → 17_factorial/factorial.js b/13_factorial/factorial.js → 17_factorial/factorial.js
diff --git a/13_factorial/factorial.spec.js → 17_factorial/factorial.spec.js b/13_factorial/factorial.spec.js → 17_factorial/factorial.spec.js
diff --git a/13_factorial/solution/factorial-solution.js → 17_factorial/solution/factorial-solution.js b/13_factorial/solution/factorial-solution.js → 17_factorial/solution/factorial-solution.js
diff --git a/...orial/solution/factorial-solution.spec.js → ...orial/solution/factorial-solution.spec.js b/...orial/solution/factorial-solution.spec.js → ...orial/solution/factorial-solution.spec.js
diff --git a/14_contains/README.md → 18_contains/README.md b/14_contains/README.md → 18_contains/README.md
@@ -1,4 +1,4 @@
-# Exercise 14 - contains
+# Exercise 18 - contains
 
 Write a function that searches for a value in a nested object. It returns true if the object contains that value.
 

diff --git a/14_contains/contains.js → 18_contains/contains.js b/14_contains/contains.js → 18_contains/contains.js
diff --git a/14_contains/contains.spec.js → 18_contains/contains.spec.js b/14_contains/contains.spec.js → 18_contains/contains.spec.js
diff --git a/14_contains/solution/contains-solution.js → 18_contains/solution/contains-solution.js b/14_contains/solution/contains-solution.js → 18_contains/solution/contains-solution.js
diff --git a/...ntains/solution/contains-solution.spec.js → ...ntains/solution/contains-solution.spec.js b/...ntains/solution/contains-solution.spec.js → ...ntains/solution/contains-solution.spec.js
diff --git a/15_totalIntegers/README.md → 19_totalIntegers/README.md b/15_totalIntegers/README.md → 19_totalIntegers/README.md
@@ -1,4 +1,4 @@
-# Exercise 15 - totalIntegers
+# Exercise 19 - totalIntegers
 
 Write a function that takes in an arbitrarily deep array or object and returns the total number of integers stored inside this array or object.
 

diff --git a/...tegers/solution/totalIntegers-solution.js → ...tegers/solution/totalIntegers-solution.js b/...tegers/solution/totalIntegers-solution.js → ...tegers/solution/totalIntegers-solution.js
diff --git a/...s/solution/totalIntegers-solution.spec.js → ...s/solution/totalIntegers-solution.spec.js b/...s/solution/totalIntegers-solution.spec.js → ...s/solution/totalIntegers-solution.spec.js
diff --git a/15_totalIntegers/totalIntegers.js → 19_totalIntegers/totalIntegers.js b/15_totalIntegers/totalIntegers.js → 19_totalIntegers/totalIntegers.js
diff --git a/15_totalIntegers/totalIntegers.spec.js → 19_totalIntegers/totalIntegers.spec.js b/15_totalIntegers/totalIntegers.spec.js → 19_totalIntegers/totalIntegers.spec.js
diff --git a/16_permutations/README.md → 20_permutations/README.md b/16_permutations/README.md → 20_permutations/README.md
@@ -1,4 +1,4 @@
-# Exercise 16 - permutations
+# Exercise 20 - permutations
 
 Write a function that takes in an empty array or an input array of an consecutive positive integers, starting at 1, and returns an array of all possible permutations of the original array
 

diff --git a/16_permutations/permutations.js → 20_permutations/permutations.js b/16_permutations/permutations.js → 20_permutations/permutations.js
diff --git a/16_permutations/permutations.spec.js → 20_permutations/permutations.spec.js b/16_permutations/permutations.spec.js → 20_permutations/permutations.spec.js
diff --git a/...tations/solution/permutations-solution.js → ...tations/solution/permutations-solution.js b/...tations/solution/permutations-solution.js → ...tations/solution/permutations-solution.js
diff --git a/...ns/solution/permutations-solution.spec.js → ...ns/solution/permutations-solution.spec.js b/...ns/solution/permutations-solution.spec.js → ...ns/solution/permutations-solution.spec.js
diff --git a/19_pascal/README.md → 21_pascal/README.md b/19_pascal/README.md → 21_pascal/README.md
@@ -1,4 +1,4 @@
-# Exercise 19 - pascal
+# Exercise 21 - pascal
 
 The pascal's triangle is modelled as follows:
 - The first row is `1`.

diff --git a/19_pascal/pascal.js → 21_pascal/pascal.js b/19_pascal/pascal.js → 21_pascal/pascal.js
diff --git a/19_pascal/pascal.spec.js → 21_pascal/pascal.spec.js b/19_pascal/pascal.spec.js → 21_pascal/pascal.spec.js
diff --git a/19_pascal/solution/pascal-solution.js → 21_pascal/solution/pascal-solution.js b/19_pascal/solution/pascal-solution.js → 21_pascal/solution/pascal-solution.js
diff --git a/19_pascal/solution/pascal-solution.spec.js → 21_pascal/solution/pascal-solution.spec.js b/19_pascal/solution/pascal-solution.spec.js → 21_pascal/solution/pascal-solution.spec.js