_172.java

package com.fishercoder.solutions;
/**Given an integer n, return the number of trailing zeroes in n!.

 Note: Your solution should be in logarithmic time complexity.*/
public class _172 {

    public int trailingZeroes(int n) {
        int result = 0;
        while(n > 4){
            n /= 5;
            result += n;
        }
        return result;
    }

}