longest_palindrome.py

def isPalindrome(input):
  length = len(input)
  half = length / 2
  
  return input[0:(half)] == input[(length - half):length][::-1]

class Solution(object):
    def longestPalindrome(self, input):
        palindrome_size = len(input)
        left = 0
        right = palindrome_size
        
        while(palindrome_size > 1):
          
          while(right <= len(input)):
            if(isPalindrome(input[left:right])):
              return input[left:right]
            else:
              left+=1
              right+=1
          
          palindrome_size-=1
          left = 0
          right = palindrome_size