Factorial trailing zeros
Return the number of trailing zeros in n factorial (n!) without computing the factorial itself, for n up to 10^9. A trailing zero comes from a factor of 10 = 2 * 5, and fives are scarcer than twos, so count the multiplicity of 5 in n! using Legendre's formula: floor(n/5) + floor(n/25) + floor(n/125) + ... Return 0 for n < 0.
Implement
factorial_trailing_zeros(n: int) → intExamples
in
[25]out6What 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 15 min
solution.py
InputExpectedGot
[25]6not run yetsample