freeCodeCamp/problem-4-largest-palindrome-product.md at 5f956e9a16b45186aa7f3ed8590c1d23ba997624

Files

Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g

2020-10-06 23:10:08 +05:30

1018 B

Raw Blame History

id, challengeType, videoUrl, title

id	challengeType	videoUrl	title
5900f3701000cf542c50fe83	5		问题4：最大的回文产品

Description

回文数字读取两种方式相同。由两个2位数字的乘积制成的最大回文是9009 = 91×99。找到由两个n数字的乘积制成的最大回文。

Instructions

Tests

tests:
  - text: <code>largestPalindromeProduct(2)</code>应返回9009。
    testString: assert.strictEqual(largestPalindromeProduct(2), 9009);
  - text: <code>largestPalindromeProduct(3)</code>应返回906609。
    testString: assert.strictEqual(largestPalindromeProduct(3), 906609);

Challenge Seed

function largestPalindromeProduct(n) {
  // Good luck!
  return true;
}

largestPalindromeProduct(3);

Solution

// solution required

/section>

1018 B Raw Blame History Unescape Escape