The Grave-Hunts of Thrennick Barrows

The barrows of Thrennick stand in a long row on the hillside, and on certain nights their dead walk. The Wardens of Thrennick post a list of grave-hunts: each hunt names the hour a barrow must be entered, the hour it may be left, and the crowns paid to whoever clears it. A lone hunter carries only one hallowed blade, so they may be on at most one hunt at any moment. Any hunt they take, they take whole, from its first hour to its last. They may take hunts in any order the hours allow, and may skip any hunt.

Write bestBounty(hunts).

• hunts is a list of hunts. Each hunt is a list of three integers [start, end, reward] with 0 <= start < end and reward >= 0. The list is in no particular order, and two hunts may be identical.
• A hunt occupies the half-open span of hours from start up to, but not including, end. Two hunts conflict if their spans share any hour. A hunt ending at hour h does not conflict with a hunt starting at hour h.
• Return a single integer: the largest total reward a lone hunter can earn by choosing a set of hunts with no two in conflict. If hunts is empty, return 0.