-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
executable file
·46 lines (40 loc) · 1.17 KB
/
Copy pathrecursion.js
File metadata and controls
executable file
·46 lines (40 loc) · 1.17 KB
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
// Complete the following functions.
const nFibonacci = (n) => {
// fibonacci sequence: 1 2 3 5 8 13 ...
// return the nth number in the sequence
return n < 2 ? 1 : nFibonacci(n - 2) + nFibonacci(n - 1);
};
const nFactorial = (n) => {
// factorial example: !5 = 5 * 4 * 3 * 2 * 1
// return the factorial of `n`
return n < 1 ? 1 : n * nFactorial(n - 1);
};
const checkMatchingLeaves = (obj) => {
// return true if every property on `obj` is the same
// otherwise return false
let value;
let allMatch = true;
// Solution from Tai
const checkLeaves = (object) => {
Object.keys(object).forEach((key) => {
if (value === undefined && typeof object[key] !== 'object') { // will only ever run once
value = object[key];
return; // breaks out of forEach
}
if (typeof object[key] === 'object') return checkLeaves(object[key]);
if (object[key] !== value) {
allMatch = false;
return; // breaks out of forEach
}
return; // breaks out of forEach
});
};
checkLeaves(obj);
return allMatch;
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves
};