Coding contest, problem 1 of 5
Your submission is recorded and graded after the round closes.
0 of 5 submitted
Factorial trailing zeros
Return the number of trailing zeros in n! (n factorial), where 0 <= n <= 1e9. For example 25! has 6 trailing zeros. You must not compute n! directly; derive the count from how many times 10 divides n!, which reduces to counting factors of 5.
Implement
factorial_trailing_zeros(n: int) → intExamples
in
[5]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[5]1not run yetsample