Palindrome

#palindrome program in python
n=int(input('Enter a number :'))
num=n
rev=0

while n>0:
 r=n%10
 rev=rev*10+r
 n//=10
print('Reverse of',num,'=',rev)
if rev==num:
  print(num,'is a palindrome number')
else :
  print(num,'is not a palindrome number')
#output
Enter a number :132
Reverse of 132 = 231
132 is not a palindrome numbe
________________________________________________________________________________
Enter a number :451
Reverse of 451 = 154
451 is not a palindrome number
________________________________________________________________________________
Enter a number :12321
Reverse of 12321 = 12321
12321 is a palindrome number

Valid Palindrome

class Solution :
   def isPalindrome(self, string: str ) :
       '''
       A function to check if a string is Palindrome or not!
       :param string: string to be checked
       :return: True if it is palindrome else False
       '''
       string = string.lower()
       s_stripped = ''.join(list( filter ( lambda x : x.isalnum () == True , string)))
       return s_stripped == s_stripped[::-1]


if __name__ == '__main__' :
   string = 'Was it a car or a cat I saw!!'
   print (f'Is "{string}" a palindrome? : {Solution ().isPalindrome (string)}')
   string2 = 'A man, a plan,'
   print (f'Is "{string2}" a palindrome? : {Solution ().isPalindrome (string2)}')

Source: favtutor.com

Palindrome number

let data = 12421

const dataOne = data.toString().split("").reverse().join("");
data = data.toString();

dataOne === data ? console.log("Palindrom")
  : console.log("Not Palindorm");

What is palindrome

function Palindrome(str) { 

  str = str.replace(/ /g,"").toLowerCase();
  var compareStr = str.split("").reverse().join("");

  if (compareStr === str) {
    return true;
  } 
  else {
    return false;
  } 

}

Is palindrom

#include <iostream>
#include <deque>
bool is_palindrome(const std::string &s){

    if(s.size() == 1 ) return true;
    std::deque<char> d ;
    for(char i : s){
        if(std::isalpha(i)){
           d.emplace_back( toupper(i) );
        }
    }

    auto front = d.begin();
    auto back = d.rbegin();
    while( (front != d.end()) || (back != d.rend())){
        bool ans = (*front == *back);
        if(!ans){
            return ans;
        }
        ++front;++back;
    }

    return true;


}

int main() {
    std::string s = "A man, a plan, a cat, a ham, a yak, a yam, a hat, a canal-Panama!";
    std::cout << std::boolalpha << is_palindrome(s) << std::endl;
    return 0;
}

Palindrome

function isPalindrome(text) {
  return [...text].reverse().join('') === text;
}

isPalindrome = text => {
	return [...text].reverse().join('') === text;
}

isPalindrome = text => [...text].reverse().join('') === text;

Similar codes

0 vote100 views1 answer
Python autotrader web
Python
0 vote115 views1 answer
Python tkinter cursor types
Python
0 vote103 views1 answer
Python polyfit with errors
Python
1 vote100 views1 answer
Python dictionary if not found
Python
65 votes101 views6 answers
Python venv
Python
0 vote138 views1 answer
Parquet pyspark
Python
1 vote107 views1 answer
Django reverse queryset
Python
0 vote140 views1 answer
Nested list flask
Python Flask
1 vote116 views2 answers
Polymorphism in python
Python
0 vote102 views1 answer
Python urlopen parameters
Python