-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpalindromeNumber.js
54 lines (38 loc) · 1.59 KB
/
palindromeNumber.js
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
// A Positive number and ad reverse together => palindrome
// 139 + 931 = 1070 => 1070 + 0701 = 1771
const reverseNumber = number => parseInt(number.toString().split("").reverse().join(""));
const isOdd = length => (length % 2 >= 1) ? true : false;
// 7 - 1 = 6/2 = 3 => Ex: editOddLengths(1234321) => 123321
const editOddLengths = num => {
const splitted = String(num).split("");
const length = splitted.length;
if (length == 1) throw new Error('Error while parsing the number')
if (isOdd(length)) {
// deleting middle one and converting to even length
splitted.splice((length - 1) / 2, 1)
return splitted;
}
}
const getCopyOfArray = arr => [...arr]
const isPalindromeNumber = number => {
let splitted = String(number).split("");
let sumLength = splitted.length;
if (isOdd(sumLength)) splitted = editOddLengths(number);
let part1 = getCopyOfArray(splitted).splice(0, (sumLength / 2)).join("")
let part2 = reverseNumber(getCopyOfArray(splitted).splice(sumLength / 2, sumLength).join(""))
if (part1 == part2) return true;
}
const calculateNumber = num => {
let result;
let reverse;
reverse = reverseNumber(num);
result = num + reverse;
let steps = 1;
while (!isPalindromeNumber(result)) {
result = result + reverseNumber(result);
steps++;
console.log(`${num} : | steps: ${steps} | result: ${result}`) // can be removed to having less logs
}
return console.log(`${num} took ${steps} steps to reach ${result} and be knows as a palindrome`);
}
console.log(calculateNumber(89))