Python implementation that runs in Θ(1) time
def solve(n): three = 3 * sum_all(math.floor(n/3)) fives = 5 * sum_all(math.floor(n/5)) sames = 15 * sum_all(math.floor(n/15)) return three + fives - sames def sum_all(n): return n*(n+1)/2
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Python implementation that runs in Θ(1) time