Available question text
Given a nonnegative integer, perform at most one swap of two digits to obtain the largest possible number. This is solved greedily by identifying the leftmost digit that can be increased by swapping with the largest digit that appears later (tracked via the digits' last occurrences).
Related questions
Continue with questions that share topics or the same question type.
- Distribute Money to Maximum Children
Coding · Greedy · Math
- Maximum Xor Product
Coding · Bit Manipulation · Greedy · Math
- Building Boxes
Coding · Binary Search · Greedy · Math
- Minimum Replacements to Sort the Array
Coding · Array · Greedy · Math
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 670. Maximum Swap
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Apple
Maximum Swap
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 63.3. This is not an interview probability.
View source