FastPrepFastPrep
Problem Brief

Count Numbers Without Repeating Digits Data & Analytics

INTERNOA

Given a range of elements, print the number of elements in the range without repeating digits. For example, the result for the range 10-13 is 3 (since 10, 12, and 13 are the valid numbers, but 11 is not because it has repeating digits).

1Example 1

Input
start = 10, end = 13
Output
3
Explanation
The valid numbers in the range 10-13 are 10, 12, and 13. The number 11 is not valid because it has repeating digits. Therefore, the count of numbers without repeating digits is 3.

Constraints

Limits and guarantees your solution can rely on.

🥝
public int countNumbersWithoutRepeatingDigits(int start, int end) {
  // write your code here
}
Input

start

10

end

13

Output

3

Sign in to submit your solution.