Leetcode 1432. Max Difference You Can Get From Changing an Integer

Given an integer, you may independently replace all occurrences of one digit with another (for each of two results) and must produce two valid non-zero integers with no leading zeros; return the maximum possible difference between them. The core challenge is picking the digit substitutions that greedily maximize one result (e.g., turning digits to 9) and minimize the other (while avoiding invalid leading zeros).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1432. Max Difference You Can Get From Changing an Integer

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact