algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 08:16:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixed Indendation Issues

Browse Source
This commit is contained in:
Abhishek Jain
2020-10-25 15:20:08 +05:30
parent 76751cfa4c
commit 5f1390fe55
1 changed files with 26 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
Project-Euler/Problem4.js
View File

@ -3,36 +3,44 @@
Find the largest palindrome made from the product of two 3-digit numbers.
*/
const largestPalindromic = (digits) => {
let i, n, m, d, inf, sup, limit, number = 0;
for (i = 1; i < digits; i++) {
number = 10 * number + 9; //
}
inf = number; // highest (digits - 1) number, in this example highest 2 digit number
sup = 10 * number + 9; // highest (digits) number, in this example highest 3 digit number
let i
let n
let m
let d
let limit
let number = 0
function isPalindromic(n) {
let p = 0, q = n, r;
for (i = 1; i < digits; i++) {
number = 10 * number + 9
}
const inf = number // highest (digits - 1) number, in this example highest 2 digit number
const sup = 10 * number + 9 // highest (digits) number, in this example highest 3 digit number
const isPalindromic = (n) => {
let p = 0
const q = n
let r
while (n > 0) {
r = n % 10;
p = 10 * p + r;
n = Math.floor(n / 10);
r = n % 10
p = 10 * p + r
n = Math.floor(n / 10)
}
return p === q; // returning whether the number is palindromic or not
return p === q // returning whether the number is palindromic or not
}
for (n = sup * sup, m = inf * inf; n > m; n--) {
if (isPalindromic(n)) {
limit = Math.ceil(Math.sqrt(n));
d = sup;
limit = Math.ceil(Math.sqrt(n))
d = sup
while (d >= limit) {
if (n % d === 0 && n / d > inf) {
return n;
return n
}
d -= 1;
d -= 1
}
}
}
return NaN; // returning not a number, if any such case arise
return NaN // returning not a number, if any such case arise
}
console.log(largestPalindromic(3));
console.log(largestPalindromic(3))