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;
}
}
Top comments (0)