new_contents: """Leetcode 5. Longest Palindromic Substring
  Medium
  
  Given a string s, find the longest palindromic substring in s. 
  You may assume that the maximum length of s is 1000.
  
  Example 1:
  Input: "babad"
  Output: "bab"
  Note: "aba" is also a valid answer.
  
  Example 2:
  Input: "cbbd"
  Output: "bb"
  """
  
  class Solution(object):
  	def longestPalindrome(self, s):
  		"""
  		:type s: str
          :rtype: str
  		"""
  		pass
  
  
  def main():
  	s = "babad"
  
  	s = "cbbd"
  
  
  if __name__ == '__main__':
  	main()
  
subject: Add lc005_longest_palindromic_substring.py