Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Palindrome
function Palindrome (x){ var z=false; var a =[]; for(j=0;j<x.length;j++){ if(x[j] != ' '){ a.push(x[j]) } } for(i=0;i<a.length-(i+1);i++){ if(a[i] == a[a.length-(i+1)]){ z=true; } else{ z=false; break } } if(z){ print("Its palindrome") } else { print("Its not palindrome") } } Palindrome("gss l ssg");
run
|
edit
|
history
|
help
1
BinaryGap, javascript - Find longest sequence of zeros in binary representation of an integer.
tt
JS exam part 2 - Moms
oneAway
codeing
9
Wall
ROSHAMBO BITCHES!
10 bottles of juice
Objects