Palindrome Partitioning
Explain the Problem
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
Example:
Input: s = "aab"
Output:
[
["a", "a", "b"],
["aa", "b"]
]
Awesome! Let's mo...
lietcode.hashnode.dev3 min read