freeCodeCamp/problem-67-maximum-path-sum-ii.english.md at df88daa4820671fc55d5856a9abd38ae141ca83e

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.3 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3b01000cf542c50fec2	5	Problem 67: Maximum path sum II

Description

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 37 4 2 4 6 8 5 9 3 That is, 3 + 7 + 4 + 9 = 23. Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows. NOTE: This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 299 altogether! If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)

Instructions

Tests

tests:
  - text: <code>euler67()</code> should return 7273.
    testString: assert.strictEqual(euler67(), 7273, '<code>euler67()</code> should return 7273.');

Challenge Seed

function euler67() {
  // Good luck!
  return true;
}

euler67();

Solution

// solution required

1.3 KiB Raw Blame History