Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Swap
Bookmark
Brute Force
Greedy
Input
Swap 2 and 7
No swap needed
Swap 1 and 9
Swap 3 and 8
Custom
num
=
2736
0
1
2
3
2
7
3
6
0
1
2
3
2
7
3
6
num =
7236
maxNum =
2736
0
1
2
3
7
2
3
6
i
j
candidate =
—
maxNum =
2736
swap
digits[0] = 2
↔
digits[1] = 7
num =
2736
maxNum =
7236
0
1
2
3
2
7
3
6
i
j
candidate =
7236
maxNum =
7236
swap back → digits =
2736
num =
2736
maxNum =
7236
0
1
2
3
2
7
3
6
i
j
candidate =
3726
maxNum =
7236
swap back → digits =
2736
num =
6732
maxNum =
7236
0
1
2
3
6
7
3
2
i
j
candidate =
6732
maxNum =
7236
candidate
6732
≤
maxNum 7236
num =
2376
maxNum =
7236
0
1
2
3
2
3
7
6
i
j
candidate =
—
maxNum =
7236
swap
digits[1] = 7
↔
digits[2] = 3
num =
2736
maxNum =
7236
0
1
2
3
2
7
3
6
i
j
candidate =
2376
maxNum =
7236
swap back → digits =
2736
num =
2736
maxNum =
7236
0
1
2
3
2
7
3
6
i
j
candidate =
2637
maxNum =
7236
swap back → digits =
2736
num =
2763
maxNum =
7236
0
1
2
3
2
7
6
3
i
j
candidate =
2763
maxNum =
7236
candidate
2763
≤
maxNum 7236
result =
7236
maxNum =
7236
0
1
2
3
7
2
3
6
candidate =
—
maxNum =
7236
Maximum =
7236
algo
master
.
io
Step:
Start: Swap at most two digits of 2736 to maximize it
0 / 20
Input
Swap 2 and 7
No swap needed
Swap 1 and 9
Swap 3 and 8
Custom
num
=
2736
0 / 20
algo
master
.
io
Step:
Start: Swap at most two digits of 2736 to maximize it
