214. Shortest Palindrome
Problem Statement
You are given a string s
. You can convert s
to a
palindrome by adding characters in front of it.
Return the shortest palindrome you can find by performing this transformation.
Example 1:
Example 2:
Constraints:
0 <= s.length <= 5 * 104
s
consists of lowercase English letters only.
Intuition
Links
https://leetcode.com/problems/shortest-palindrome/description/
Video Links
https://www.youtube.com/watch?v=c4akpqTwE5g&ab_channel=IDeserve
Approach 1:
C++
Approach 2:
C++
Approach 3:
C++
Approach 4:
C++
Similar Problems
Previous28. Find the Index of the First Occurrence in a String / KMP AlgorithmNext1392. Longest Happy Prefix
Last updated