Leetcode Problem 1432 | Max difference you can get by changing the Integer | java | c++ | Hindi

🎯 Problem Description (For Video)
You're given an integer num. You must perform the following digit-replacement operation two separate times:

🔁 Steps for Each Operation:

Pick a digit x from 0 to 9.

Pick another digit y from 0 to 9. y can be the same as x.

Replace all occurrences of digit x in num with digit y.

Let the results of the two operations be numbers a and b.

⚠️ Important Rules:

The resulting numbers must not start with a zero.

The results cannot be zero.

✅ Your task is to return the maximum difference between a and b.

🧪 Example 1
Input: num = 555

First operation: Replace 5 with 9 → a = 999

Second operation: Replace 5 with 1 → b = 111

Max Difference = 999 minus 111 = 888

🧪 Example 2
Input: num = 9

First operation: Replace 9 with 9 → a = 9

Second operation: Replace 9 with 1 → b = 1

Max Difference = 9 minus 1 = 8

📌 Strategy:

To maximize the number, replace digits with 9.

To minimize it, replace leading digit with 1 (if possible), or other digits with 0.

Make sure there's no leading zero in the final result.

Let’s solve this step by step!

Видео Leetcode Problem 1432 | Max difference you can get by changing the Integer | java | c++ | Hindi канала MissLogic - "Where code meets Clarity."