longest-palindromic-substring

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code>, return the longest palindromic substring in <code>s</code>.

&nbsp;
Example 1:

<pre>
Input: s = &quot;babad&quot;
Output: &quot;bab&quot;
Explanation: &quot;aba&quot; is also a valid answer.
</pre>

Example 2:

<pre>
Input: s = &quot;cbbd&quot;
Output: &quot;bb&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consist of only digits and English letters.</li>
</ul>

longestPalindrome

Longest Palindromic Substring

Shortest Palindrome

shortest-palindrome

最短回文串

Palindrome Permutation

palindrome-permutation

回文排列

Palindrome Pairs

palindrome-pairs

回文对

Longest Palindromic Subsequence

longest-palindromic-subsequence

最长回文子序列

Palindromic Substrings

palindromic-substrings

回文子串

Maximum Number of Non-overlapping Palindrome Substrings

maximum-number-of-non-overlapping-palindrome-substrings

不重叠回文子字符串的最大数目

Two Pointers

String

Dynamic Programming

给你一个字符串 <code>s</code>，找到 <code>s</code> 中最长的 回文 子串。

&nbsp;

示例 1：

<pre>
输入：s = "babad"
输出："bab"
解释："aba" 同样是符合题意的答案。
</pre>

示例 2：

<pre>
输入：s = "cbbd"
输出："bb"
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> 仅由数字和英文字母组成</li>
</ul>