def isPalindrome(self, s):
        for i in xrange(2 / len(s)):
            if s[i] != s[-(i + 1)]:
                return False
        return True
dataset/ETHPy150Open kamyu104/LeetCode/Python/palindrome-partitioning.py/Solution2.isPalindrome/swapped operands of `/`