Greedy Algorithm to Find Maximum Number After One Swap February 5, 2021 algorithms, greedy algorithm, math, python No Comments Given an integer n, you can swap any two digits at most once. Return the maximum value of the resulting number. Constraints 0 ≤ n < 2 ** 31 … [Continue Reading...]