Palindrome partition all
Given a string `s`, partition it so that every substring of the partition is a palindrome, and return all possible such partitionings. Each partition is a list of substrings that concatenate back to `s`. The order of partitions in the output does not matter. 1 <= len(s) <= 16.
Implement
partition_palindromes(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