Palindrome Partitioning Problem Statement

You are given a string S. Your task is to partition S such that every substring of the partition is a palindrome. Your objective is to return all possible palindrome partitioning configurations for S.

Example:

Input:

"BaaB"

Output:

["B", "a", "a", "B"]
["B", "aa", "B"]
["BaaB"]

Explanation:

There are three possible palindrome partitioning of the string "BaaB":

["B", "a", "a", "B"]

["B", "aa", "B"]

["BaaB"]

In each partition, every substring is a palindrome.

Constraints:

0

Question

Palindrome Partitioning Problem Statement

You are given a string S. Your task is to partition S such that every substring of the partition is a palindrome. Your objective is to return all possible palindrome partitioning configurations for S.

Example:

Input:

"BaaB"

Output:

["B", "a", "a", "B"]
["B", "aa", "B"]
["BaaB"]

Explanation:

There are three possible palindrome partitioning of the string "BaaB":

["B", "a", "a", "B"]
["B", "aa", "B"]
["BaaB"]

In each partition, every substring is a palindrome.

Constraints:

0 <= |S| <= 15
|S| denotes the length of string S.
Time Limit: 1 sec.

Accepted Answer

Partition a string into palindromes and return all possible configurations.

Use backtracking to generate all possible palindrome partitions of the string.
Check if each substring is a palindrome before adding it to the partition.
Return all valid partitions as an array of strings.