Solution: Largest Number
Understand how to solve the problem of arranging a list of non-negative integers into the largest possible number by using a greedy algorithm. Learn to apply a custom comparator that orders number strings based on their concatenation results and grasp the time and space complexity of this approach.
We'll cover the following...
We'll cover the following...
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:
nums.lengthnums[i]...