Palindrome Partitioning In PHP: All Possible Palindrome Partitions
Partitioning a string into palindromes: [["a","a","b"],["aa","b"]]. Use backtracking & dynamic programming to explore all possible partitions, checking each for being a palindrome.
131. Palindrome Partitioning Difficulty: Medium Topics: String, Dynamic Programming, Backtracking Given a string s, partition s such that every substring1 of the partition is a palindrome2. 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 <= s.length <= 16 s contains only lowercase English letters. Solution: We can use a combination of backtracking and dynamic programming. The goal is to explore all possible partitions and check if each partition is a palindrome....