Preparing this workspace.
Palindrome Partitioning
Difficulty: Medium
Category: DSA
Topics: String, Dynamic Programming, Backtracking
Asked at: Amazon, Apple, Google
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"]]
```
**Example 2:**
**Input:** s = "a"
**Output:** [["a"]]
```
**Constraints:**
- `1 <= s.length <= 16`
- `s` contains only lowercase English letters.
Opening the problem
Progress is saved as you study.