Package g1701_1800.s1745_palindrome_partitioning_iv

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1745 - Palindrome Partitioning IV.

    Hard

    Given a string s, return true if it is possible to split the string s into three non-empty palindromic substrings. Otherwise, return false.

    A string is said to be palindrome if it the same string when reversed.

    Example 1:

    Input: s = "abcbdd"

    Output: true

    Explanation: "abcbdd" = "a" + "bcb" + "dd", and all three substrings are palindromes.

    Example 2:

    Input: s = "bcbddxy"

    Output: false

    Explanation: s cannot be split into 3 palindromes.

    Constraints:

    • 3 <= s.length <= 2000

    • s consists only of lowercase English letters.

    • 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 Boolean checkPartitioning(String s)

      • Methods inherited from class java.lang.Object

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