Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Speedy category for Park Benches by _Chico_
def park_benches(benches: list[tuple[int, int]], distance: int) -> int:
best_bench = {}
for (bench_start, length) in benches:
max_previous = max((v for k, v in best_bench.items()
if k <= bench_start - distance), default=0)
best_bench[bench_start + length] = length + max_previous
return max(best_bench.values())
May 18, 2021
