Given a numeric string, num_str, representing a palindromeA palindrome is a number that reads the same backward as it does forward. (composed only of digits). Return the smallest palindrome larger than num_str that can be created by rearranging its digits. If no such palindrome exists, return an empty string "".

Consider the following example to understand the expected output for a given numeric string:

• input string = "123321"

• The valid palindromes made from the exact digits are "213312", "231132", "312213", "132231", "321123".

• We return the palindrome "132231" because it is the smallest palindrome larger than the input string "123321".

Constraints:

• $1 \leq$ num_str.length $\leq 10^5$

• num_str is a palindrome.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.