Open GH1995 opened 5 years ago
Difficulty: 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"
214. Shortest PalindromeCopy
Difficulty: 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:
Example 2: