All Problems

Maximum Swap

Medium•array•Expected: O(n) time, O(1) space•Interview Context

Problem

Given a non-negative integer, swap two digits at most once to get the maximum valued number.

Loading...