Tap here to switch tabs
Problem
Submissions

Problem: Palindrome Partitioning

Palindrome Partitioning asks you to split a string into every possible sequence of contiguous parts, ensuring each part reads the same forward and backward, and return all such sequences.

Statement

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitionings of s.

Note: A palindrome is a string that reads the same backward as forward.

Constraints:

  • 1≤1 \leq s.length ≤16\leq 16

  • s contains only lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Palindrome Partitioning

Palindrome Partitioning asks you to split a string into every possible sequence of contiguous parts, ensuring each part reads the same forward and backward, and return all such sequences.

Statement

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitionings of s.

Note: A palindrome is a string that reads the same backward as forward.

Constraints:

  • 1≤1 \leq s.length ≤16\leq 16

  • s contains only lowercase English letters.