131. Palindrome Partitioning

[LeetCode] 131. Palindrome Partitioning

131. Palindrome Partitioning Medium 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"]] Example 2: Input: s = "a" Output: [["a"]] Constraints: 1 = len(s): self.ans.append(temp.copy()) for i in range(idx, len(s)): if palin(s, idx, i): temp.append(s..