Skip to content

jecarica/triangle-app

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages