freeCodeCamp

2.1 KiB

Raw Blame History

id	challengeType	title	forumTopicId
5900f3971000cf542c50feaa	5	Problem 43: Sub-string divisibility	302100

Description

The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.

Let d₁ be the 1^st digit, d₂ be the 2^nd digit, and so on. In this way, we note the following:

d₂d₃d₄ = 406 is divisible by 2
d₃d₄d₅ = 063 is divisible by 3
d₄d₅d₆ = 635 is divisible by 5
d₅d₆d₇ = 357 is divisible by 7
d₆d₇d₈ = 572 is divisible by 11
d₇d₈d₉ = 728 is divisible by 13
d₈d₉d₁₀ = 289 is divisible by 17

Find the numbers of all 0 to 9 pandigital numbers with this property.

Instructions

Tests

tests:
  - text: <code>substringDivisibility()</code> should return an array.
    testString: assert(Array.isArray(substringDivisibility()));
  - text: <code>substringDivisibility()</code> should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ].
    testString: assert.sameMembers(substringDivisibility(), [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ]);
  - text: You should not copy and return the array.
    testString: assert(!__helpers.removeJSComments(code).match(/(1430952867)|(1460357289)|(1406357289)|(4130952867)|(4160357289)|(4106357289)/))

Challenge Seed

function substringDivisibility() {

  return [];
}

substringDivisibility();

Solution

// solution required

2.1 KiB Raw Blame History