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

30:00

Palindrome Partitioning
medium
Topics
Companies

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

Example 1:
Input: {"s":"aab"}
Output: [["a","a","b"],["aa","b"]]
Constraints:

  • 1≤s.length≤161 \leq s.\text{length} \leq 16

  • s contains only lowercase English letters.

Input
arr ={"s":"aab"}

Check index 0

a

i

a

b

Current Partition

Empty

Results
Variables
No variables to display
DepthFunction Call
Stack empty
0/26