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