Available question text
Return the number of trailing zeros in n! by determining how many times 10 divides n!, which reduces to counting factors of 5 in the product; compute the sum floor(n/5) + floor(n/25) + ... for an O(log n) solution.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 172. Factorial Trailing Zeroes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source