factorial-trailing-zeroes

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer <code>n</code>, return the number of trailing zeroes in <code>n!</code>.

Note that <code>n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1</code>.

&nbsp;
Example 1:

<pre>
Input: n = 3
Output: 0
Explanation: 3! = 6, no trailing zero.
</pre>

Example 2:

<pre>
Input: n = 5
Output: 1
Explanation: 5! = 120, one trailing zero.
</pre>

Example 3:

<pre>
Input: n = 0
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= n &lt;= 104</code></li>
</ul>

&nbsp;
Follow up: Could you write a solution that works in logarithmic time complexity?

trailingZeroes

Factorial Trailing Zeroes

Math

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs