take two pointers first move pointer1 by a distance=n now move both the pointers till pointer1 reaches end you would see that pointer 2 points to nth node from last....
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
take two pointers
ReplyDeletefirst move pointer1 by a distance=n
now move both the pointers till pointer1 reaches end
you would see that pointer 2 points to nth node from last....
@ankit absolutely correct approach...:)
ReplyDelete