Available question text
Given a (large) integer n, compute the n-th positive integer in the sequence formed by removing all numbers that contain the digit '9' — a digit-DP / combinatorics problem that can be solved by counting valid numbers per prefix or by converting between base-10 and a base-9-like representation to handle very large n.
Related questions
Continue with questions that share topics or the same question type.
- Design a Data Structure with Insert, Remove, and GetRandom for Unique Elements in O(1)
Coding
- Design a Song Playlist with Add/Remove Functions
Coding
- Find and remove duplicate files
Coding · File & Media Storage · Operating Systems
- Find Minimum Cost to Remove Array Elements
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 660. Remove 9
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source