Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given a number, in the form of an array **Num[]** of size **N** containing digits from **1 to 9**(inclusive). The task is to find the **next smallest palindrome strictly larger than the given number.**

**Example 1:**

**Input:
**N = 11
Num[] = {9, 4, 1, 8, 7, 9, 7, 8, 3, 2, 2}
**Output:** 9 4 1 8 8 0 8 8 1 4 9
**Explanation:** Next smallest palindrome is
94188088149.

**Example 2:**

**Input:
**N = 5
Num[] = {2, 3, 5, 4, 5}
**Output:** 2 3 6 3 2
**Explanation:** Next smallest palindrome is
23632.

**Your Task:**

Complete the function **generateNextPalindrome()** which takes an array **num, **and an single integer **n**, as input parameters and returns an array of integers denoting the answer. You don't to print answer or take inputs.

**Expected Time Complexity:** O(N)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= N <= 10^{5}

1 <= Num[i] <= 9

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Next Smallest Palindrome

...