Airbnb

Ski Path — Max Score on a Weighted DAG

Members only

Given a weighted directed acyclic graph where edges carry a cost and nodes carry a reward, compute the maximum `sum(rewards) - sum(costs)` over any path from a fixed `START` to any `END` node.