Package g0201_0300.s0214_shortest_palindrome

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    214 - Shortest Palindrome\.

    Hard

    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"

    Constraints:

    • <code>0 <= s.length <= 5 * 10<sup>4</sup></code>

    • s consists of lowercase English letters only.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String shortestPalindrome(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait