Top-Interview-Questions--Leetcode
Top-Interview-Questions--Leetcode copied to clipboard
Factorial Trailing Zeroes
Problem : Given an integer n, return the number of trailing zeroes in n!.
Note that n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1.
Input: n = 5
Output: 1
Explanation: 5! = 120, one trailing zero.
@syedareehaquasar @KhushbooGoel01 please assign me this issue
Hii @KhushbooGoel01 can you please assign this issue
go ahead @santushtisharma10 ! @AnkitPatel1999 please choose one of the languages and mention here and communicate within yourselves to divide the issue into parts! (u can use this space) happy contributions!
I will do the cpp solution
Hey, I would like to Python solution.Can you please assign ?