Minimum removals in a number to be divisible by 10K
Given two positive integers N and K. Find the minimum number of digits that can be removed from the number N such that after removals the number is divisible by 10K or print -1 if it is impossible. Examples: Input : N = 10904025, K = 2 Output : 3 Explanation : We can remove … Read more