• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Generate next palindrome number

September 17, 2014 by Dhaval Dave

Several Companies like MS, Amazon and Flipkart has started asking this question to Generate next palindrome number.

Say K is given, Generate N such that N is palindrome and N > K.

Logic 1)  Create a Function which checks a number is palindrome or not.

while(1)
{
   flag = checkPali(++k);
   if (flag ==1) break;
}

Logic 2)

Generate number it self from given number.

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
    char a[1000002];
    int test,i,flag,check,l,m,k;
    scanf("%dn",&test);
    while(test--)
    {
        flag=1;
        gets(a);
        l=strlen(a);
        // baseof(length / 2) in integer.
        k=l>>1; 
        check=0;
        for(i=0;i<l;i++)
        {
            if(a[i]!='9')
            {
                flag=0;
                break;
            }
        }
        //handling case when 9, 99, 999 is given.(only 9s)
        if(flag==1)
        {
            a[0]='1';
            for(i=1;i<l;i++)
                a[i]='0';
            a[l]='1';
            a[l+1]='';
            check=1; //to check palindrome or not number
        }
        
        flag=0;
        if(check!=1)
        {
            for(i=0;i<k;i++)
            {
                if(a[i]<a[l-1-i]){
                flag=-1;
                }
                else if(a[i]>a[l-1-i]){
                flag=1;}
                a[l-1-i]=a[i];
            }

            if(!(l&1))
            m=k-1;
            else m=k;
            if(flag==0||flag==-1)
            {
                i=0;
                while(a[m-i]=='9')
                {
                    a[m-i]='0';
                    a[l-1-m+i]='0';
                    i++;
                }

                a[m-i]++;
                a[l-1-m+i]=a[m-i];
        }
    }
    printf("%sn",a);
    }
    return 0;
}

 

Here is sample code. http://ideone.com/pfGBf9

Similar Articles

Filed Under: Adobe Interview Questions, Amazon Interview Question, Flipkart Interview Questions, Microsoft Interview Questions, problem Tagged With: Array

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Get K Max and Delete K Max in stream of incoming integers

Reversal of LinkedList

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Implement LRU Cache

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Longest Increasing Subsequence

flattens 2 D linked list to a single sorted link list

Maximum size of square sub matrix with all 1’s in a binary matrix

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Get Minimum element in O(1) from input numbers or Stack

Implement a generic binary search algorithm for Integer Double String etc

Print Power Set of a Set

Advanced SQL Injection

ADOBE Aptitude C Language Test

How strtok() Works

Maximum sum contiguous subarray of an Array

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Check Binary Tree is Binary Search Tree or not

Count number of ways to reach a given score in a game

C++ OOPs Part2

DFS (Depth First Search)

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Connect n ropes with minimum cost

Templates in C++

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Apriori algorithm C Code Data Mining

1014 Practice Question of New GRE – Princeton

Copyright © 2026 · Genesis Framework · WordPress · Log in