79d9012432
* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
59 lines
1.5 KiB
Markdown
59 lines
1.5 KiB
Markdown
---
|
|
id: 5900f3cf1000cf542c50fee1
|
|
challengeType: 5
|
|
title: 'Problem 98: Anagramic squares'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: 1296 = 362. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216 = 962. We shall call CARE (and RACE) a square anagram word pair and specify further that leading zeroes are not permitted, neither may a different letter have the same digital value as another letter.
|
|
Using words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, find all the square anagram word pairs (a palindromic word is NOT considered to be an anagram of itself).
|
|
What is the largest square number formed by any member of such a pair?
|
|
NOTE: All anagrams formed must be contained in the given text file.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler98()</code> should return 18769.
|
|
testString: assert.strictEqual(euler98(), 18769, '<code>euler98()</code> should return 18769.');
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler98() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler98();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|