Hacker News Reader

Yup, Bellman Ford is the algorithm we had in mind for this puzzle. It's similar to Dijkstra's algorithm, but deals with negative costs as well.

(I work at Priceonomics)

View on HN

I really like what you guys do. It is a great concept, and it sounds like a really fun domain to work in. I hope I didn't ruin the puzzle by blurting this out.

I thought you would want the most negative cycle, which would be NP-hard to find.

Reply on news.ycombinator.com