mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-20 18:43:43 +08:00
Remove live code & console.log, leave examples as comments (ProjectEuler, Recursive).
This commit is contained in:
@ -2,7 +2,7 @@
|
||||
/* A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
|
||||
Find the largest palindrome made from the product of two 3-digit numbers.
|
||||
*/
|
||||
const largestPalindromic = (digits) => {
|
||||
export const largestPalindromic = (digits) => {
|
||||
let i
|
||||
let n
|
||||
let m
|
||||
@ -43,4 +43,4 @@ const largestPalindromic = (digits) => {
|
||||
return NaN // returning not a number, if any such case arise
|
||||
}
|
||||
|
||||
console.log(largestPalindromic(3))
|
||||
|
||||
|
Reference in New Issue
Block a user