LeetCode – Factorial Trailing Zeroes (Java)

Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. Java Solution public int trailingZeroes(int n) { if (n < 0) return -1;   int count = 0; for (long i = 5; n / i >= 1; i *= 5) { count += … Read more