Palindrome Partitioning

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"]]
Explanation: "a","a","b" are all palindromes, and "aa","b" are all palindromes.

Example 2

Input: s = "a"
Output: [["a"]]
Explanation: A single character is always a palindrome.

---

Constraints

• 1 <= s.length <= 16
• s consists only of lowercase English letters.