freeCodeCamp/problem-442-eleven-free-integers.md at 2c9a900353d88bfc6736681b7ca63201ddea4dd5

Oliver Eyton-Williams 2b9e38a17b

2020-09-29 22:09:04 +02:00

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f5271000cf542c510039	5	Problem 442: Eleven-free integers	302114

Description

An integer is called eleven-free if its decimal expansion does not contain any substring representing a power of 11 except 1.

For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.

Let E(n) be the nth positive eleven-free integer. For example, E(3) = 3, E(200) = 213 and E(500 000) = 531563.

Find E(1018).

tests:
  - text: <code>euler442()</code> should return 1295552661530920200.
    testString: assert.strictEqual(euler442(), 1295552661530920200);

function euler442() {

  return true;
}

euler442();

// solution required