DEV Community

Vaibhav sisodiya
Vaibhav sisodiya

Posted on

1

(Solution) Know Basic Maths - Strivers A2Z DSA Course/Sheet

a. Count Digits - GFG Question
Given a number N. Count the number of digits in N which evenly divides N.

Example 1:

Input:
N = 12
Output:
2
Explanation:
1, 2 both divide 12 evenly

Solution :

class Solution{
    static int evenlyDivides(int N){
        int evenD = 0,cp=N;
        while(cp>0){
            int lastD = cp%10;
            if(lastD ==0){
                cp /= 10;
                continue;
            }
            if(N%lastD==0){
                evenD++;
            }
            cp = cp/10;
        }
        return evenD;
    }
}
Enter fullscreen mode Exit fullscreen mode

Top comments (0)

Great read:

Is it Time to go Back to the Monolith?

History repeats itself. Everything old is new again and I’ve been around long enough to see ideas discarded, rediscovered and return triumphantly to overtake the fad. In recent years SQL has made a tremendous comeback from the dead. We love relational databases all over again. I think the Monolith will have its space odyssey moment again. Microservices and serverless are trends pushed by the cloud vendors, designed to sell us more cloud computing resources.

Microservices make very little sense financially for most use cases. Yes, they can ramp down. But when they scale up, they pay the costs in dividends. The increased observability costs alone line the pockets of the “big cloud” vendors.

👋 Kindness is contagious

Please leave a ❤️ or a friendly comment on this post if you found it helpful!

Okay