Check palindrome and find next larger palindrome

Problem Statement

Given a positive integer represented as a string s, perform two tasks:

1. Return True if s is a palindrome, otherwise False.
2. Find the smallest palindrome strictly greater than s. If the input is already a palindrome, you must return the next smallest palindrome larger than it. The output should be returned as a string.

Constraints

• 1 <= len(s) <= 10^5
• The string contains only digits 0-9.
• The result might exceed the range of a 64-bit integer, so treat it as a string.

Examples

Example 1

• Input: s = "121"
• Output: "131"
• Explanation: "121" is a palindrome. The next larger palindrome is "131".

Example 2

• Input: s = "999"
• Output: "1001"
• Explanation: For numbers consisting only of 9s, the next palindrome is always 1 followed by n-1 zeros and a 1.

Implementation

def get_next_palindrome(s: str) -> str:
    # Return a tuple: (is_palindrome: bool, next_palindrome: str)
    pass