AMCAT Automata Fix Sample Question-5

int isPalindrome(string S)
	{
	    int left=0;
    	    int right=S.length()-1;
    while(left<=right){
        if(    ){
            return 0;
        }else{
             left     ;
            right    ;
        }
    }
    if(    ){
        return 1;
	    }
	}

int isPalindrome(string S)
	{
	    int left=0;
    	    int right=S.length()-1;
    while(left<=right){
        if(S[left]!=S[right]){
            return 0;
        }else{
            left++;
            right--;
        }
    }
    if(left>right){
        return 1;
	    }
	}