Search
⌘K
Get Premium
Leetcode 738. Monotone Increasing Digits
Given n, return the largest integer ≤ n whose digits are nondecreasing left-to-right (each digit ≤ the next); the challenge is to transform n's digits to enforce this monotone property while maximizing the resulting value.
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.