# ---
# title: 516. Longest Palindromic Subsequence
# id: problem516
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Dynamic Programming
# link: <https://leetcode.com/problems/longest-palindromic-subsequence/description/>
# hidden: true
# ---
# 
# 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".
# 
# 
# 
# **Constraints:**
# 
#   * `1 <= s.length <= 1000`
#   * `s` consists only of lowercase English letters.
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
