FastPrepFastPrep
Problem Brief

Count Numbers with Sum of Digits

INTERNOA
See Cisco online assessment and hiring insights

Given an integer X, write an algorithm to find the number of integers which are less than or equal to X and whose digits add up to Y.

Input

The first line of input consists of an integer - inputNum1, representing the given number X. The next line consists of an integer - inputNum2, representing the given number Y.

Output

Print the count of numbers whose digits add up to Y for the given number X.

Note

If no numbers are found whose digits add up to Y for the given number X, then print -1.

1Example 1

Input
inputNum1 = 20, inputNum2 = 5
Output
2
Explanation
Note - Explanation is an educated guess :) There are two numbers less than or equal to 20 whose digits add up to 5: 14 (1 + 4) and 5 (5). Therefore, the output is 2.

Constraints

Limits and guarantees your solution can rely on.

🥭🥭
public int countNumbersWithSumOfDigits(int inputNum1, int inputNum2) {
  // write your code here
}
Input

inputNum1

20

inputNum2

5

Output

2

Sign in to submit your solution.