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

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.