Tap here to switch tabs
Problem
Submissions

Problem: Palindrome Partitioning IV

Palindrome Partitioning IV asks whether a string can be split into exactly three nonempty palindromic substrings, returning true when every part reads the same forward and backward.

Statement

Given a string s, determine whether it can be partitioned into 33 non empty palindromic substrings. Return true if such a partition is possible, or false otherwise.

A string is considered palindromic if it reads the same forwards and backwards.

Constraints:

  • 3≤3 \leq s.length ≤2000\leq 2000

  • s consists only of lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Palindrome Partitioning IV

Palindrome Partitioning IV asks whether a string can be split into exactly three nonempty palindromic substrings, returning true when every part reads the same forward and backward.

Statement

Given a string s, determine whether it can be partitioned into 33 non empty palindromic substrings. Return true if such a partition is possible, or false otherwise.

A string is considered palindromic if it reads the same forwards and backwards.

Constraints:

  • 3≤3 \leq s.length ≤2000\leq 2000

  • s consists only of lowercase English letters.