Practice Monotone Increasing Digits
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
An integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y. Given an integer n, return the largest number that is less than or equal to n with monotone increasing digits.
Source: Monotone Increasing Digits on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
n = 10
Output
9
# Example 2
Input
n = 1234
Output
1234
# Example 3
Input
n = 332
Output
299
Constraints
0 <= n <= 10^9
Related LeetCode Problems
Practice more problems similar to Monotone Increasing Digits.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.