Katkat

Find the Next Larger Palindrome

UberData Scientist · Onsite

Last updated

This question evaluates proficiency in numeric and string manipulation, algorithmic thinking, and edge-case reasoning related to palindromic number generation.

Given a positive integer n, return the smallest integer strictly greater than n whose decimal representation is a palindrome.

A palindrome reads the same from left to right and right to left. Do not allow leading zeros.

Examples:

  • n = 9 -> 11
  • n = 123 -> 131
  • n = 808 -> 818
  • n = 999 -> 1001

Discuss edge cases such as single-digit inputs, numbers consisting only of 9s, even versus odd digit lengths, and inputs that are already palindromes.