When given a positive number value, return a palindromic number and how many steps it took to reach that number.
Create a function named palindromeNumberGenerator which takes a Number value. Check if the number is a Palindromic Number, if it's not then add together the value and the value-reversed and check if the sum is a palindromic number, repeat until you reach a palindromic number value. Each time you sum up the values to get a new number to check, increase the step count by 1.
Input will always be a positive integer.
Lets, start with palindromeNumberGenerator(87):
87is not a palindromic number, so we will add87 + 78(78 is 87 reversed)- increase our steps by 1
165is not a palindromic number, so we will add165 + 651- increase our steps by 1
726is not a palindromic number, so we will add726 + 627- increase our steps by 1
1353is not a palindromic number, so we will add1353 + 3531- increase our steps by 1
4884is a palindromic number. Your function will return an object{ value: 4884, steps: 4 }
palindromeNumberGenerator(1331):
1331is a palindromic number. Your function will return an object{ value: 1331, steps: 0 }