-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPersistent Bugger
More file actions
31 lines (20 loc) · 876 Bytes
/
Copy pathPersistent Bugger
File metadata and controls
31 lines (20 loc) · 876 Bytes
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
6 kyu
Persistent Bugger.
Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit.
For example:
persistence(39) === 3 // because 3*9 = 27, 2*7 = 14, 1*4=4
// and 4 has only one digit
persistence(999) === 4 // because 9*9*9 = 729, 7*2*9 = 126,
// 1*2*6 = 12, and finally 1*2 = 2
persistence(4) === 0 // because 4 is already a one-digit number
const persistence = (num, i = 0) => {
if([...num.toString()].length === 1) return i;
let numArr = [...num.toString()].reduce((acc, curr) => {
return acc * +curr;
})
i++
return persistence(numArr, i)
}
console.log(persistence(39),3);
console.log(persistence(4),0);
console.log(persistence(25),2);