• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.21
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2301_2400.s2376_count_special_integers.readme.md Maven / Gradle / Ivy

2376\. Count Special Integers

Hard

We call a positive integer **special** if all of its digits are **distinct**.

Given a **positive** integer `n`, return _the number of special integers that belong to the interval_ `[1, n]`.

**Example 1:**

**Input:** n = 20

**Output:** 19

**Explanation:** All the integers from 1 to 20, except 11, are special. Thus, there are 19 special integers. 

**Example 2:**

**Input:** n = 5

**Output:** 5

**Explanation:** All the integers from 1 to 5 are special. 

**Example 3:**

**Input:** n = 135

**Output:** 110

**Explanation:** There are 110 integers from 1 to 135 that are special.

Some of the integers that are not special are: 22, 114, and 131.

**Constraints:**

*   1 <= n <= 2 * 109