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

Constraints:

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

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the problem correctly:

We have a game for you to play. Rearrange the logical building blocks to better understand how to solve this problem.

Implement your solution in the following coding playground.