hells-triangle

Hells Triangle - Challenge

Given a triangle of numbers, find the maximum total from top to bottom Example:

   6
  3 5
 9 7 1
4 6 8 4

In this triangle the maximum total is: 6 + 5 + 7 + 8 = 26

An element can only be summed with one of the two nearest elements in the next row.

For example: The element 3 in the 2nd row can only be summed with 9 and 7, but not with 1

Your code will receive an (multidimensional) array as input.

The triangle from above would be:

example = [[6],[3,5],[9,7,1],[4,6,8,4]]

The solution was implemented using Ruby, based on the following criterias:

1- Focus on simplicity and productivity
2- It has elegant syntax of natural reading and easy writing
3- It offers resources for implementation of automated tests

Follow the steps below to build and run the solution.

For installation of the dependencies it will be necessary to install the Bundle. After installation, run:

bundle install

BDD feature was created using Cucumber.

Feature for solution get_maximum_total_triangle.feature:

Feature: Get maximum total to triangle

  Scenario: To get value Maximum Total
    Given a triangle with values:
      | 6       |
      | 3,5     |
      | 9,7,1   |
      | 4,6,8,4 |
    When to obtain total maximum value
    Then should return the value: 26

Run the command in the features directory:

cucumber

Run the command to execute the unit test:

ruby -I test src/test/models/triangle_test.rb