Leetcode 670. Maximum Swap
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.