Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 590 |

@rdakka | 538 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

For an integer **N** find the number of trailing zeroes in **N!.**

**Example 1:**

Input:N = 5Output:1Explanation:5! = 120 so the number of trailing zero is 1.

**Example 2:**

Input:N = 4Output:0Explanation:4! = 24 so the number of trailing zero is 0.

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **trailingZeroes()** which take an integer N as an input parameter and returns the count of trailing zeroes in the N!.

**Expected Time Complexity:** O(logN)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= N <= 10^{9}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Trailing zeroes in factorial

...