Problem
Submissions

Problem: Maximum Swap

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

⋮
Problem
Submissions

Problem: Maximum Swap

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