Palindrome partitions
Partition a string into contiguous substrings such that every substring is a palindrome, and return every possible partitioning. Each partition is a list of substrings in left-to-right order; return the overall list sorted. The empty string yields a list containing one empty partition. Input length is at most 12.
Implement
palindrome_partition(s: str) → list[list[str]]Examples
in
["aab"]out[["a","a","b"],["aa","b"]]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
["aab"][["a","a","b"],["aa","b"]]not run yetsample