-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
57 lines (51 loc) · 1.17 KB
/
recursion.js
File metadata and controls
57 lines (51 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
47
48
49
50
51
52
53
54
55
56
57
// Complete the following functions.
const nFibonacci = (n) => {
if (n === 1) {
return 1;
}
if (n === 2) {
return 2;
}
return (nFibonacci(n - 1) + nFibonacci(n - 2));
// fibonacci sequence: [0 1] 1 2 3 5 8 13 ...
// return the nth number in the sequence
};
const nFactorial = (n) => {
if (n === 1) {
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) => {
let val;
let flag = true;
const traverseTree = (tree) => {
Object.keys(tree).forEach((key) => {
if (typeof key !== 'object' && val === undefined) {
val = tree[key];
return undefined;
}
if (typeof tree[key] === 'object') {
return traverseTree(tree[key]);
}
if (tree[key] !== val) {
flag = false;
return undefined;
}
return undefined;
});
return flag;
};
return traverseTree(obj);
// return true if every property on `obj` is the same
// otherwise return false
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};