shortest-palindrome

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a string <code>s</code>. You can convert <code>s</code> to a palindrome by adding characters in front of it.

Return the shortest palindrome you can find by performing this transformation.

&nbsp;
Example 1:
<pre>Input: s = "aacecaaa"
Output: "aaacecaaa"
</pre>Example 2:
<pre>Input: s = "abcd"
Output: "dcbabcd"
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= s.length &lt;= 5 * 104</code></li>
	<li><code>s</code> consists of lowercase English letters only.</li>
</ul>

shortestPalindrome

Shortest Palindrome

Longest Palindromic Substring

longest-palindromic-substring

最长回文子串

Find the Index of the First Occurrence in a String

find-the-index-of-the-first-occurrence-in-a-string

找出字符串中第一个匹配项的下标

Palindrome Pairs

palindrome-pairs

回文对

Maximum Deletions on a String

maximum-deletions-on-a-string

对字母串可执行的最大删除数

Smallest Palindromic Rearrangement I

smallest-palindromic-rearrangement-i

最小回文排列 I

String

String Matching

Manacher 算法

Hash Function

Rolling Hash

KMP 算法

扩展 KMP

给定一个字符串 s，你可以通过在字符串前面添加字符将其转换为回文串。找到并返回可以用这种方式转换的最短回文串。

&nbsp;

示例 1：

<pre>
输入：s = "aacecaaa"
输出："aaacecaaa"
</pre>

示例 2：

<pre>
输入：s = "abcd"
输出："dcbabcd"
</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= s.length &lt;= 5 * 104</code></li>
	<li><code>s</code> 仅由小写英文字母组成</li>
</ul>