FastPrepFastPrep
Problem Brief

Unique Digits in Range

INTERNOA

Given a range [a, b], count how many numbers in that range have all unique digits.

1Example 1

Input
a = 5, b = 11
Output
6
Explanation
^o^
public int countUniqueDigits(int a, int b) {
  // write your code here
}
Input

a

5

b

11

Output

6

Sign in to submit your solution.