Trailing Zeros in Factorial

https://www.interviewbit.com/problems/trailing-zeros-in-factorial/
int Solution::trailingZeroes(int A) {
    int c=0;
    while(A>0)
    {
        c+=A/5;;
        A=A/5;
    }
    return c;
}


 

Comments

Post a Comment

Popular posts from this blog

Vertical Order Traversal of a Binary Tree

Image
 https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/ https://gist.github.com/SuryaPratapK/d73b9a97c2c8a2af762af106b794ad2d      //soln class Solution { map<int,map<int,multiset<int>>> mymap; void solve(TreeNode *curr,int col,int row) { if(!curr) return; mymap[col][row].insert(curr->val); solve(curr->left,col-1,row+1); solve(curr->right,col+1,row+1); } public: vector<vector<int>> verticalTraversal(TreeNode* root) { solve(root,0,0); vector<vector<int>> ans; ...
Read more

Integer To Roman

 string Solution::intToRoman(int A) {     int n[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};        string r[] = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};     auto i = 0;     string result = "";          while (A!=0)     {         while (A>=n[i])         {             result += r[i];             A -= n[i];         }         ++i;     }     return result; }
Read more

Contains Duplicate II

 https://leetcode.com/problems/contains-duplicate-ii/ class Solution { public:     bool containsNearbyDuplicate(vector<int>& nums, int k) {         unordered_map<int,int>m;         for(int i=0;i<nums.size();i++){             if(m.count(nums[i])){                 int diff=abs(i-m[nums[i]]);                 if(diff<=k){                     return true;                 }             }             m[nums[...
Read more