Search⌘ K
AI Features

Solution: Largest Number

Explore how to rearrange a list of non-negative integers into the largest possible number by applying a custom sorting approach. Understand the greedy technique of comparing concatenated string pairs to decide their order. Gain insights into implementing a comparator and handling edge cases, preparing you for optimization problems in coding interviews.

Statement

Given a list of non-negative integers, nums, rearrange them so that they form the largest possible number. As the result may be very large, return it as a string.

Constraints:

  • 11 \leq nums.length 100\leq 100

  • 00 \leq nums[i] 103\leq 10^3

Solution

At first glance, one might think sorting the numbers from largest to smallest would work, but that fails in cases like [3,30][3, 30]. Putting 3030 before ...