Geeksforgeeks Solution For " Palindrome "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given an integer, check whether it is a palindrome or not.

Palindrome :- A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward, such as madam or racecar. Sentence-length palindromes may be written when allowances are made for adjustments to capital letters, punctuation, and word dividers, such as "A man, a plan, a canal, Panama!", "Was it a car or a cat I saw?" or "No 'x' in Nixon". Wikipedia

Submit Your Solution :- Click Here 

Solution :-

#include <iostream>
using namespace std;

int main() 
int t;
   int n,reverse=0,temp;
   temp = n;

   while (temp != 0)
      reverse = reverse * 10;
      reverse = reverse + temp%10;
      temp    = temp/10;

   if (n == reverse)

return 0;


Geeksforgeeks Solution For " Palindrome "

No comments:

Post a Comment