@@ -0,0 +1,676 @@
+package com.hackerrank;%0A%0Aimport java.util.Scanner;%0A%0Apublic class FindDigits %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int cases = in.nextInt();%0A        for (int i = 0; i %3C cases; i++) %7B%0A            int number = in.nextInt();%0A            System.out.println(divisibleDigits(number));%0A        %7D%0A    %7D%0A%0A    private static int divisibleDigits(int no) %7B%0A        int iter = no;%0A        int result = 0;%0A        while (iter %3E 0) %7B%0A            int digit = iter %25 10;%0A            if (digit != 0 && no %25 digit == 0) %7B%0A                result++;%0A            %7D%0A            iter = iter / 10;%0A        %7D%0A        return result;%0A    %7D%0A%7D%0A

Find Digits - HR - E