README.md

example-ce

This application reads triangle numbers from the standard input. After that is done it finds, if possible, min path sum. Time complexity of the algorithm is O(N^2) where N is the number of rows.

Run application

sbt run

Run tests

sbt test