Palindrome partitions
Given a string s, return all ways to partition s such that every substring of the partition is a palindrome. Each partition is a list of substrings (in order); return the list of partitions sorted lexicographically (comparing the lists of pieces). s has at most 16 lowercase letters.
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