Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
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 738. Monotone Increasing Digits
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source