//2.Search for all possible divisor of str.length, starting for length/2 //3.If i is a divisor of length, repeat the substring from 0 to i the number of times i is contained in s.length //4.If the ...

// I have to create a function which basically make substring and check whether its last digit is divisible by substring or not. and, there is a count variable, if substring is divisible then we have ...