**What is your hint or solution suggestion?**

Hint to Project Euler 206 - Concealed Square

## Summary

```
function match(n) {
n = n.toString();
let j = 0;
for (let i=1;i<10;i++) {
if (parseInt(n[j]) != i) return false;
j += 2;
}
return true;
}
function concealedSquare() {
let n = 19293949596979899;
let x = parseInt(Math.sqrt(n)) + 1;
while (!match(x**2)) {
x -= 2;
}
return x*10;
}
console.log(concealedSquare());
```

**Challenge:** Problem 206: Concealed Square

**Link to the challenge:**