Loading problem

Palindrome Partitioning

Given a string `s`, partition it so that every substring of the partition is a palindrome. Return all possible partitionings, sorted for a deterministic result.

Examples

in: s = "aab"

out: [["a","a","b"],["aa","b"]]

the two palindromic partitions

Constraints

1 <= len(s) <= 12 for tests
s is lowercase letters

Hints

target: O(n * 2^n) time⌘↩ run · ⇧⌘↩ submit