Leetcode Problem 2566 | Maximum Difference by Remapping a Digit | English | java| c++

🎯 Find the Maximum Difference After Digit Remapping | Leetcode Style Problem

In this video, we're solving an interesting integer manipulation challenge!

🔢 Problem:
Given an integer num, a sneaky Bob can remap one digit (0-9) to any other digit, and this change is applied to all instances of that digit in the number.
👉 Bob can use one digit remapping to maximize the value, and a different remapping to minimize it.
Your task? Return the difference between the maximum and minimum values possible.

📌 Rules:

Only one digit is remapped at a time.

You can remap to the same digit (no effect).

Leading zeroes are allowed in the result.

🧠 Examples:

Input: 11891 ➡️ Max: 99899, Min: 890 ➡️ Output: 99009

Input: 90 ➡️ Max: 99, Min: 0 ➡️ Output: 99

🔥 Great for practicing string manipulation, greedy thinking, and edge case handling.

👨‍💻 Watch till the end for an optimized solution and dry run!

#coding #leetcode #interviewprep #digitremap #greedyalgorithm