ID | Title | Difficulty | |
---|---|---|---|
Loading... |
214. Shortest Palindrome
Hard
LeetCode
String, Rolling Hash, String Matching, Hash Function
Problem
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:
Input: s = "aacecaaa"
Output: "aaacecaaa"
Example 2:
Input: s = "abcd"
Output: "dcbabcd"
Code
按 <- 键看上一题!
213. House Robber II
按 -> 键看下一题!
215. Kth Largest Element in an Array