Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1012. Numbers With Repeated Digits
Count how many positive integers ≤ n contain at least one repeated digit. Solve by complementary counting / digit-DP: compute how many numbers ≤ n have all unique digits using permutations across digit positions (digits ≤ 10, n up to ~10^9) and subtract from n.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.