eef1805fe6
* fix: clean-up Project Euler 201-220 * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
39 lines
574 B
Markdown
39 lines
574 B
Markdown
---
|
|
id: 5900f43a1000cf542c50ff4d
|
|
title: 'Problem 206: Concealed Square'
|
|
challengeType: 5
|
|
forumTopicId: 301847
|
|
dashedName: problem-206-concealed-square
|
|
---
|
|
|
|
# --description--
|
|
|
|
Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each "_" is a single digit.
|
|
|
|
# --hints--
|
|
|
|
`concealedSquare()` should return `1389019170`.
|
|
|
|
```js
|
|
assert.strictEqual(concealedSquare(), 1389019170);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function concealedSquare() {
|
|
|
|
return true;
|
|
}
|
|
|
|
concealedSquare();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|