Problem

Submissions

Problem: Maximum Swap

Statement

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

Constraints:

$0 \leq$ num $\leq 10^5$

Examples

Problem

Submissions

Problem: Maximum Swap

Statement

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

Constraints:

$0 \leq$ num $\leq 10^5$

Examples