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 most two digits once.

Constraints:

  • 0≤ ...