← All problemsSign in

3747. Count Distinct Integers After Removing Zeros

LeetCodeMathDynamic ProgrammingOpen on judge ↗

You are given a positive integer n. For every integer x from 1 to n, we write down the integer obtained by removing all zeros from the decimal representation of x. Return an integer denoting the number of distinct integers written down. Example 1: Input: n = 10 Output: 9 Explanation: The integers we wrote down are 1, 2, 3, 4, 5, 6, 7, 8, 9, 1. There are 9 distinct integers (1, 2, 3, 4, 5,

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

Sign in to chat with the tutor and save your progress.

Sign in to start