C# solution:

public static int findDigits(int n)
{
    int divisors = 0;
    int test = n % 10;
    int remainder = n;
    while (remainder > 0)
    {
        if (test != 0)
        {
            if (n % test == 0)
            {
                divisors++;
            }
        }
        remainder /= 10;
        test = remainder % 10;
    }
    return divisors;
}

//JAVA15 import java.io.; import java.util.; import java.util.stream.*;

class Result {

/*
 * Complete the 'findDigits' function below.
 *
 * The function is expected to return an INTEGER.
 * The function accepts INTEGER n as parameter.
 */

public static int findDigits(int n) {
    int count = 0;
    int original = n;

    while (n > 0) {
        int digit = n % 10;
        if (digit != 0 && original % digit == 0) {
            count++;
        }
        n /= 10;
    }

    return count;
}

}

public class Solution { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

    int t = Integer.parseInt(bufferedReader.readLine().trim());

    IntStream.range(0, t).forEach(tItr -> {
        try {
            int n = Integer.parseInt(bufferedReader.readLine().trim());
            int result = Result.findDigits(n);
            bufferedWriter.write(String.valueOf(result));
            bufferedWriter.newLine();
        } catch (IOException ex) {
            throw new RuntimeException(ex);
        }
    });

    bufferedReader.close();
    bufferedWriter.close();
}

}

optimal approach but first requesting other learner to understand the code first

function findDigits(n) {
    // Write your code here
    let num = n
    let cnt = 0
    
    while(num > 0){
        const lastDigi = num % 10
        if(lastDigi !== 0 && (n % lastDigi === 0)){
            cnt++
        }
        num = Math.floor(num/10)
    }
    return cnt
}

Easy Solution

def findDigits(Num:int):
    numbers = list(str(Num))
    count = 0
    
    for num in numbers:
        num = int(num)
        if num == 0:
            continue
        elif Num % num == 0:
            count += 1
    return count

A Teradata Performance DBA plays a crucial role in maintaining the efficiency of large-scale data environments by optimizing queries, monitoring system health, and ensuring smooth data flow. Just like a skilled DBA enhances performance behind the scenes, the Zenco dou delivers a refined experience for those who value smooth functionality in their lifestyle tools. Whether in tech or relaxation, performance and reliability matter—and that's where the Zenco duo makes its mark. Click Here:-https://kreativezen.com/products/zenco-duo