@@ -0,0 +1,502 @@
+/***%0A * Given an integer n, return the number of trailing zeroes in n!.%0A *%0A * Note: Your solution should be in logarithmic time complexity.%0A */%0A%0Apublic class Solution %7B%0A    // (2, 5) combine occurs cause one trailing zero,%0A    // as 2 is very common, only 5 counts%0A    public int trailingZeroes(int n) %7B%0A        if (n == 0) return 0;%0A        int c5 = 0;%0A        int size;%0A        while (n %3E 0) %7B%0A            size = n/5;%0A            c5 += size;%0A            n /= 5;%0A        %7D%0A        return c5;%0A%0A    %7D%0A%7D%0A

add FactorialTrailingZeroes.java