longest-palindromic-subsequence

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given a string <code>s</code>, find the longest palindromic subsequence&#39;s length in <code>s</code>.

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

&nbsp;
Example 1:

<pre>
Input: s = &quot;bbbab&quot;
Output: 4
Explanation: One possible longest palindromic subsequence is &quot;bbbb&quot;.
</pre>

Example 2:

<pre>
Input: s = &quot;cbbd&quot;
Output: 2
Explanation: One possible longest palindromic subsequence is &quot;bb&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consists only of lowercase English letters.</li>
</ul>

longestPalindromeSubseq

Longest Palindromic Subsequence

String

Dynamic Programming

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie