...

/

Solution: Largest Palindromic Number

Solution: Largest Palindromic Number

Let’s solve the Largest Palindromic Number problem using the Greedy pattern.

Statement

You are given a string num consisting of digits from 00 to 99. Your task is to return the largest possible palindromic number as a string by using some or all of the digits in num. The resulting palindromic number must not have leading zeros.

Note: You may reorder the digits freely, and you must use at least one digit from the num string.

Constraints:

  • 11\leq num.length ...