{"size": 475, "ext": "js", "max_stars_repo_path": "001_025/problem_004.js", "max_stars_repo_name": "solendil/euler", "max_stars_repo_stars_event_min_datetime": "2019-06-29T02:56:59.000Z", "max_stars_repo_stars_event_max_datetime": "2019-06-29T02:56:59.000Z", "max_issues_repo_path": "001_025/problem_004.js", "max_issues_repo_name": "solendil/euler-javascript", "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "001_025/problem_004.js", "max_forks_repo_name": "solendil/euler-javascript", "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null}
{"max_stars_count": 1, "max_issues_count": null, "max_forks_count": null, "avg_line_length": 29.6875, "max_line_length": 136, "alphanum_fraction": 0.6105263158}
// 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.
problem[4] = {
  answer:906609,
  solver:function() {
    let res=0;
    for(let i=100; i<1000; i++)
      for(let j=100; j<1000; j++) {
        let nb = i*j;
        if (isPalindrome(String(nb)))
          res=Math.max(res, nb);
      }
    return res;
  }
};
