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 Elena_Korljukova
from typing import List
def evenly_spaced_trees(trees: List[int]) -> int:
t = [i - j for i, j in zip(trees[1:], trees[:-1])]
k = [x for x in range(1, min(t) + 1) if all(i%x == 0 for i in t)][-1]
return sum(t)//k - len(t)
if __name__ == '__main__':
print("Example:")
print(evenly_spaced_trees([0, 2, 6]))
assert evenly_spaced_trees([0, 2, 6]) == 1, 'add 1'
assert evenly_spaced_trees([1, 3, 6]) == 3, 'add 3'
assert evenly_spaced_trees([0, 2, 4]) == 0, 'no add'
print("Coding complete? Click 'Check' to earn cool rewards!")
Aug. 1, 2020
