---
id: 5900f3701000cf542c50fe83
challengeType: 5
title: 'Problem 4: Largest palindrome product'
videoUrl: ''
localeTitle: 问题4：最大的回文产品
---

## Description
<section id="description">回文数字读取两种方式相同。由两个2位数字的乘积制成的最大回文是9009 = 91×99。找到由两个<code>n</code>数字的乘积制成的最大回文。 </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
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);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

largestPalindromeProduct(3);

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>