Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Evenly Spaced Trees by _Chico_
from typing import List
def evenly_spaced_trees(trees: List[int]) -> int:
trees_number = len(trees)
distance = trees[-1]-trees[0]
intervals = [right-left for left, right in zip(trees[:-1], trees[1:])]
min_interval = min(intervals)
while min_interval > 0 and any(interval%min_interval != 0 for interval in intervals):
min_interval -= 1
return distance//min_interval+1-trees_number
July 10, 2021
