var letters = [];
var word = "racecar" //bob
var rword = "";
//put letters of word into stack
for (var i = 0; i < word.length; i++) {
letters.push(word[i]);
}
//pop off the stack in reverse order
for (var i = 0; i < word.length; i++) {
rword += letters.pop();
}
if (rword === word) {
console.log("The word is a palindrome");
}
else {
console.log("The word is not a palindrome");
}
#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;
}
// Should Check if the argument passed is a string
function isPalindrome(str){
return typeof str === "string"
? str.split("").reverse().join("") === str
: "Value is not a type string";
}//Reverses every character in the string
func Reverse(s string) (result string){
for _,v := range s {
result = string(v) + result
}
return
}
//Check if the string is same as it is reversed
func Check(s string) (b bool){
a := Reverse(s)
if s == a{
b = true
}else {
b = false
}
return
}function palindrome(str) {
if (str.toLowerCase() === str.toString().toLowerCase().split('').reverse().join('')) {
return true;
} else {
return false;
}
}import java.util.Scanner;
class Palindrome {
public static void main(String args[]) {
String original, reverse = "";
Scanner s1 = new Scanner(System.in);
System.out.println("Enter a word");
original = "cat";
int length = original.length();
for ( int i = length - 1; i >= 0; i-- )
reverse = reverse + original.charAt(i);
if (original.equals(reverse))
System.out.println("true");
else
System.out.println("false");
}
}