Palindrome Partitioning - Practice Coding | SlaveCode
Problems
Scratchpad
Run
Submit
0
0
1
2
3
4
5
6
7
8
9
0
0
1
2
3
4
5
6
7
8
9
:
0
0
1
2
3
4
5
6
7
8
9
0
0
1
2
3
4
5
6
7
8
9
Toggle theme (Current: Custom)
Scratchpad
Run
Submit
Description
Hints
Solutions
131. Palindrome Partitioning
Medium
30 Points
String
Dynamic Programming
Backtracking
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
Examples
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.
JAVASCRIPT
Code
Tests
Result
Description
Hints
Solutions
131. Palindrome Partitioning
Medium
30 Points
String
Dynamic Programming
Backtracking
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
Examples
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.
JAVASCRIPT
Code
Tests
Result