chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -0,0 +1,46 @@
|
||||
---
|
||||
id: 5900f41e1000cf542c50ff31
|
||||
title: 'Problem 178: Step Numbers'
|
||||
challengeType: 5
|
||||
forumTopicId: 301813
|
||||
dashedName: problem-178-step-numbers
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
Consider the number 45656.
|
||||
|
||||
It can be seen that each pair of consecutive digits of 45656 has a difference of one.
|
||||
|
||||
A number for which every pair of consecutive digits has a difference of one is called a step number.
|
||||
|
||||
A pandigital number contains every decimal digit from 0 to 9 at least once.
|
||||
|
||||
How many pandigital step numbers less than 1040 are there?
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler178()` should return 126461847755.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler178(), 126461847755);
|
||||
```
|
||||
|
||||
# --seed--
|
||||
|
||||
## --seed-contents--
|
||||
|
||||
```js
|
||||
function euler178() {
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
euler178();
|
||||
```
|
||||
|
||||
# --solutions--
|
||||
|
||||
```js
|
||||
// solution required
|
||||
```
|
Reference in New Issue
Block a user