Grokking the Coding Interview Patterns in Python/

...

/

Solution: Maximum Swap

Solution: Maximum Swap

Let’s solve the Maximum Swap problem using the Greedy Techniques pattern.

We'll cover the following...

Statement

Given an integer num, return the maximum number that can be formed by swapping at most two digits once.

Constraints:

  • 0≤0 \leq num ≤105\leq 10^5 ...