new_contents: """Leetcode 516. Longest Palindromic Subsequence
  Medium
  
  URL: https://leetcode.com/problems/longest-palindromic-subsequence/
  
  Given a string s, find the longest palindromic subsequence's length in s.
  You may assume that the maximum length of s is 1000.
  
  Example 1:
  Input:
  "bbbab"
  Output:
  4
  One possible longest palindromic subsequence is "bbbb".
  
  Example 2:
  Input:
  "cbbd"
  Output:
  2
  One possible longest palindromic subsequence is "bb".
  """
  
  class Solution(object):
      def longestPalindromeSubseq(self, s):
          """
          :type s: str
          :rtype: int
          """
          pass
  
  
  def main():
      pass
  
  
  if __name__ == '__main__':
      main()
  
subject: Add lc0516_longest_palindromic_subsequence.py