Given a positive integer N, return the number of positive integers less than or equal to N that have at least 1 repeated digit.
 

Example 1:
Input: 20
Output: 1
Explanation: The only positive number (<= 20) with at least 1 repeated digit is 11.


Example 2:
Input: 100
Output: 10
Explanation: The positive numbers (<= 100) with atleast 1 repeated digit are 11, 22, 33, 44, 55, 66, 77, 88, 99, and 100.


Example 3:
Input: 1000
Output: 262


 
Note:

1 <= N <= 10^9

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def numDupDigitsAtMostN(self, N: int) -> int:\n        ## https://leetcode.com/problems/numbers-with-repeated-digits/discuss/256725/JavaPython-Count-the-Number-Without-Repeated-Digit\n#     \\"\\"\\"\n#     The corner case is too hard to manage...\n\n#     count res as N - total number without duplicated digits.\n#     turns into a math and permutation problem.\n\n#     select m out of n\n#     P(m, n): n! / (n-m)!\n\n#     Algorithm:\n\n#     lets say N has k digits.\n#     1) count number less than k digits\n#     lets say number with i digits\n#     first digit 1 ~ 9, following option is 0 ~ 9 without first digit\n#     count = 9 * P(i-1,9)\n\n#     2) count number has k digits. \n#     Calculate digits with same prefix. \n#     Prefix cannot has duplicate digits.\n#     for case like 77xxx, we should stop the calculation.\n#     \\"\\"\\"\n        \n        def numPerm(n, r):\n            return math.factorial(n)//math.factorial(n-r)\n        \n        \n        # N + 1 as padding.\n        nums = [int(d) for d in str(N + 1)]\n        K = len(nums) # N has K digits\n        cnt = 0 # number with no repeated val\n         # count **postive number with digits less than K\n        for i in range(1, K):\n            cnt += 9*numPerm(9, i-1)\n            \n        # count number with K digits\n        seen = set() # seen digit\n        for i in range(K): \n            # prefix = nums[:i] + currentDigit\n            # currentDigit < nums[i]\n            for x in range(1 if i == 0 else 0, nums[i]):\n                if x in seen: continue # avoid duplication\n                # cnt += P(K - (i + 1), 10 - (i + 1))\n                cnt += numPerm(10 - (i + 1), K - (i + 1))\n            \n            # since next iteration, prefix has duplicate digits, break\n            if nums[i] in seen: break\n            seen.add(nums[i])\n        \n        return N - cnt\n        \n       \n        \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'numDupDigitsAtMostN'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6126