freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.chinese.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3971000cf542c50feaa	5	Problem 43: Sub-string divisibility		问题43：子串可分性

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert.deepEqual(substringDivisibility(), [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ], "<code>substringDivisibility()</code> should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ].");'

Challenge Seed

function substringDivisibility() {
  // Good luck!
  return [];
}

substringDivisibility();

Solution

// solution required