cpp-flashcards/org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org

• 0131. Palindrome Partitioning
  • Approach
  • Python
  • C++

TODO 0131. Palindrome Partitioning   medium

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.

TODO Approach

Write your approach here.

TODO Python

class Solution:
    def partition(self, s: str) -> List[List[str]]:

TODO C++

class Solution {
public:
    vector<vector<string>> partition(string s) {
        
    }
};