problem214

README

< Previous 　　　　　　　　　　　　　　　　 Next >

214. Shortest Palindrome (Hard)

Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.

Example 1:

Input: "aacecaaa"
Output: "aaacecaaa"

Example 2:

Input: "abcd"
Output: "dcbabcd"

Related Topics

[String]

Similar Questions

1. Longest Palindromic Substring (Medium)
2. Implement strStr() (Easy)
3. Palindrome Pairs (Hard)