1.6 KiB
1.6 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f40a1000cf542c50ff1d | 5 | Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left | 问题158:探索在其邻居之后只有一个字符按字典顺序出现的字符串 |
Description
Instructions
Tests
tests:
- text: <code>euler158()</code>应该返回409511334375。
testString: 'assert.strictEqual(euler158(), 409511334375, "<code>euler158()</code> should return 409511334375.");'
Challenge Seed
function euler158() {
// Good luck!
return true;
}
euler158();
Solution
// solution required