666 B
666 B
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4031000cf542c50ff15 | 5 | Problem 150: Searching a triangular array for a sub-triangle having minimum-sum |
Description
undefined
Instructions
undefined
Tests
tests:
- text: ''
testString: 'assert.strictEqual(euler150(), -271248680, "<code>euler150()</code> should return -271248680.");'
Challenge Seed
function euler150() {
// Good luck!
return true;
}
euler150();
Solution
// solution required