Leetcode 660. Remove 9
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.