Files
freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-244-sliders.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828)
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

81 lines
1.6 KiB
Markdown
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f4601000cf542c50ff72
challengeType: 5
title: 'Problem 244: Sliders'
---
## Description
<section id='description'>
You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we have seven red tiles and eight blue tiles.
A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration (S), by the sequence LULUR we reach the configuration (E):
(S), (E)
For each path, its checksum is calculated by (pseudocode):
checksum = 0
checksum = (checksum × 243 + m1) mod 100000007
checksum = (checksum × 243 + m2) mod 100000007
   …
checksum = (checksum × 243 + mn) mod 100000007
where mk is the ASCII value of the kth letter in the move sequence and the ASCII values for the moves are:
L76R82U85D68
For the sequence LULUR given above, the checksum would be 19761398.
Now, starting from configuration (S),
find all shortest ways to reach configuration (T).
(S), (T)
What is the sum of all checksums for the paths having the minimal length?
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler244()</code> should return 96356848.
testString: assert.strictEqual(euler244(), 96356848, '<code>euler244()</code> should return 96356848.');
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler244() {
// Good luck!
return true;
}
euler244();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>