Palindrome Partitioning

The problem Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitionings of s. A substring is a contiguous non-empty sequence of characters within a string. A palindrome is a string that reads the same forward and backward. Examples Input: s = "aab" Output: [["a","a","b"],["aa","b"]] Input: s = "a" Output: [["a"]] Constraints 1 <= s.length <= 16 s contains only lowercase English letters. Explanation From the description of the problem we learn that we are given string s that we need to partition in a way that all substrings are palindromes. ...