Grokking the Coding Interview Patterns/

...

/

Maximum Swap

Maximum Swap

Try to solve the Maximum Swap problem.

We'll cover the following...

Statement

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

Constraints:

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

Examples

Access this course and 1400+ top-rated courses and projects.