https://github.com/nygardk/r_fasttrack_pt3
Reaktor Fast Track pt3 solution
https://github.com/nygardk/r_fasttrack_pt3
Last synced: 27 days ago
JSON representation
Reaktor Fast Track pt3 solution
- Host: GitHub
- URL: https://github.com/nygardk/r_fasttrack_pt3
- Owner: nygardk
- Created: 2014-03-14T10:41:14.000Z (about 11 years ago)
- Default Branch: master
- Last Pushed: 2020-10-05T08:00:03.000Z (over 4 years ago)
- Last Synced: 2025-01-31T21:35:29.851Z (3 months ago)
- Language: CSS
- Size: 509 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Description
This is a solution to a coding problem [published](http://reaktor.fi/careers/fast_track/) by Reaktor.
Solution.js contains a simple solution to the problem, where as
browser_demo contains another solution and runs a graphical demo
inspired by Sega Out Run.
You may see the demo in action here:
[http://demos.klausnygard.fi/reaktor-fast-track-pt3-solution/](http://demos.klausnygard.fi/reaktor-fast-track-pt3-solution/)
## Problem definition
Find the largest sum along the route from the top of a tree to the bottom without
examining every possible path. The best path is the one with largest cumulative
sum from the nodes. Example tree:
5
14 23
81 23 43
43 51 33 10
where the largest sum would cumulate by route [5,14,81,51], thus resulting in
the best path.