Solution: Next Palindrome Using Same Digits

Understand how to use the two pointers technique to rearrange digits in a numeric palindrome string to find the smallest palindrome larger than the given input. This lesson teaches splitting the string, generating the next lexicographical permutation of the left half, and mirroring it to form the new palindrome, offering an efficient approach with O(n) complexity.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

Given a numeric string, numStr, 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 numStr 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$ ...