Given a range of integers, determine how many number's have no repeating digits

Example

n

$=$

$8$

$0$

m

$=$

$1$

$2$

$0$

The lowe and upper bounds are inclusive, so there are

$1$

$2$

$0$

$-$

$7$

$9$

$=$

$4$

$1$

$$in the range. Numbers without repeating characters are normal weight and others are bold. The two columns to the right are the valid number counts per row

$($

Normal weight

$)$

$$and invalid number counts

$($

bold

$)$

$.$

There are

$2$

$7$

$$numbers with ni repeating digits and

$1$

$4$

$$other numbers in the range. print

$2$

$7$

$.$

countNumber has the following paramener

$($

s

$)$

:

int arr

$[$

q

$]$

$[$

$2$

$]$

: integer pairs representing inclusive lower

$($

n

$)$

$$and upper

$($

m

$)$

$$range limits

print each pair arr

$[$

i

$]$

$,$

$$print the number of integers in the inclusive range that qualify. There is no value to return from the function