Two is a Trouble

CodeChefOpen on judge ↗

You are given a number $N$. And you are asked to find the number of integer numbers up to $N$, such that they do not contain more than $2$ unique digits in their decimal representation. (for e.g. integer $123$ has $3$ unique digits thus this won't be a valid integer in any given scenario). ###Input: - The first and only line contains $N$. ###Output: Print an integer, denoting the answer

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI