Palindrome Partitioning

medium

Given a string s, split it into segments where each segment is a palindrome (reads the same forwards and backwards).

Return all possible ways to partition the string into palindromic segments.

Constraints:

Example 1:

Input:

s = "noon"

Output:

[["n","o","o","n"], ["n","oo","n"], ["noon"]]

Explanation:

Example 2:

Input:

s = "civic"

Output:

[["c","i","v","i","c"], ["c","ivi","c"], ["civic"]]

Now up to 15% off

Reading Progress

On This Page

Building Intuition

Finding All Partitions

Backtracking

The Algorithm

Checking for Palindromes

Walkthrough

Solution

Optimization: Precompute Palindromes