-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
49 lines (44 loc) · 1.06 KB
/
Copy pathrecursion.js
File metadata and controls
49 lines (44 loc) · 1.06 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
47
48
49
// Complete the following functions.
const nFibonacci = (n) => {
if (n < 2) {
return n;
}
return nFibonacci(n - 2) + nFibonacci(n - 1);
// fibonacci sequence: 1 1 2 3 5 8 13 ...
// return the nth number in the sequence
};
const nFactorial = (n) => {
if (n === 0) return 1;
return n * nFactorial(n - 1);
// factorial example: !5 = 5 * 4 * 3 * 2 * 1
// return the factorial of `n`
};
/* Extra Credit */
const checkMatchingLeaves = (obj) => {
const values = [];
function gatherValues(innerObj) {
Object.keys(innerObj).forEach((key) => {
if (typeof innerObj[key] === 'object') {
gatherValues(innerObj[key]);
} else {
values.push(innerObj[key]);
}
});
}
// return true if every property on `obj` is the same
// otherwise return false
gatherValues(obj);
const first = values[0];
for (let i = 1; i < values.length; i++) {
if (values[i] !== first) {
return false;
}
}
return true;
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};