Thanks to visit codestin.com
Credit goes to www.educative.io

Maximum Swap

Try to solve the Maximum Swap problem.

Statement

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

Constraints:

  • 0≤ ...