[LeetCode 131] 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.

For example, given s = "aab", Return

[
  ["aa","b"],
  ["a","a","b"]
]

Diffculty
Medium

Similar Problems
[LeetCode ] Palindrome Partitioning II Hard

Analysis