xxxxxxxxxx
function palindromeNumber(num) {
let numStr = num.toString();
return numStr === numStr.toString().split("").reverse().join("");
}
xxxxxxxxxx
function palindrome2(str) {
return str.toLowerCase() === str.toString().toLowerCase().split('').reverse().join('') ? true : false;
}
xxxxxxxxxx
function palindrome(str) {
var re = /[\W_]/g;// representing Non-alphanumetic characters
var lowRegStr = str.toLowerCase().replace(re, '');
var reverseStr = lowRegStr.split('').reverse().join('');
return reverseStr === lowRegStr;
}
palindrome("A man, a plan, a canal. Panama");
xxxxxxxxxx
bool isPalindrom(string str){
for (int i = 0; i < str.length(); i++)
if(str[i]!=str[str.length()-i]) return false;
return true;
}
xxxxxxxxxx
function isPalindrome(str) {
str = str.toLowerCase();
return str === str.split("").reverse().join("");
}
xxxxxxxxxx
<script>
// function that check str is palindrome or not
function check_palindrome( str )
{
let j = str.length -1;
for( let i = 0 ; i < j/2 ;i++)
{
let x = str[i] ;//forward character
let y = str[j-i];//backward character
if( x != y)
{
// return false if string not match
return false;
}
}
/// return true if string is palindrome
return true;
}
//function that print output is string is palindrome
function is_palindrome( str )
{
// variable that is true if string is palindrome
let ans = check_palindrome(str);
//condition checking ans is true or not
if( ans == true )
{
console.log("passed string is palindrome ");
}
else
{
console.log("passed string not a palindrome");
}
}
// test variable
let test = "racecar";
is_palindrome(test);
</script>
xxxxxxxxxx
// Given a string, return true or false depending if the string
// is a palindrome. Palindromes are words that read the same backwards
// and forwards. Make sure it is case insensitive!
// --- Examples:
// palindrome("Madam") === true
// palindrome("love") === false
function palindrome(str) {
return (str.toLowerCase().split("").reverse().join("") === str.toLowerCase())
}
xxxxxxxxxx
// can we generate palindrome string by suffling
// the character of the string s
public bool CanBePalindrome(string s)
{
var dict = new Dictionary<char, int>();
for (int j =0; j < s.Length; j++)
{
var item = s[j];
if (dict.ContainsKey(item))
{
dict[item]++;
if (dict[item] == 2)
{
dict.Remove(item);
}
}
else
{
dict.Add(item, 1);
}
}
return dict.Count <= 1;
}