Palindrome or not

by Krishna Ananthi

JavaScript

function isPalindrome(num) {
  const copy = num;
  if (num < 0 || num > 2 ** 32) {
    return false;
  }
  let rev = 0;
  while (num > 0) {
    let digit = num % 10;
    rev = rev * 10 + digit;
    num = parseInt(num / 10);
    //  console.log(num)
  }
  if (copy == rev) {
    return true;
  }
  return false;
}

// complexity -->o(n)
console.log(isPalindrome(121))
console.log(isPalindrome(-121))
console.log(isPalindrome(123))
console.log(isPalindrome(4321234))

function isPalindromeStr(s) {
  let left = 0;
  let right = s.length - 1;
	while(left<right){
  	if(s[left] != s[right]){
    return false;
    }left++;
    right--;
  }return true;
}

console.log("ananthi",isPalindromeStr("ananthi"));
console.log("madam",isPalindromeStr("madam"));