Palindrome String in Javascript

This is a classical problem asked in mostly all the interviews.
I am posting the solution in Javascript, you can convert it in the language of your own choice.

Algo:

1. Use two pointers (left & right)
2. Put left at the start of string and right at the end of string
3. Check the value at pointer and take decision on the basis of equality
4. Move the pointers towards each other
5. Until left is smaller than equal to right

Code:

 const isPalindrome  = function(A){
    A = A.replace(/[^0-9a-zA-Z]/g, "");
    A = A.toLowerCase();
    var left = 0
    var right = A.length; - 1;
    while(left <= right) {
        if(A[left] !== A[right]) {
            return 0
        }
        left++;
        right--;
    }
    return 1;
}

Note: In the above solution I have omitted the special characters and spaces.

Feel free to post suggestions or more efficient code