1.8 KiB
1.8 KiB
id | challengeType | title |
---|---|---|
5900f3d61000cf542c50fee7 | 5 | Problem 103: Special subset sums: optimum |
Description
Instructions
Tests
tests:
- text: <code>euler103()</code> should return 20313839404245.
testString: assert.strictEqual(euler103(), 20313839404245, '<code>euler103()</code> should return 20313839404245.');
Challenge Seed
function euler103() {
// Good luck!
return true;
}
euler103();
Solution
// solution required