palindrome-partitioning

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code>, partition <code>s</code> such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of <code>s</code>.

&nbsp;
Example 1:
<pre>Input: s = "aab"
Output: [["a","a","b"],["aa","b"]]
</pre>Example 2:
<pre>Input: s = "a"
Output: [["a"]]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 16</code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
</ul>

partition

Palindrome Partitioning

Palindrome Partitioning II

palindrome-partitioning-ii

分割回文串 II

Palindrome Partitioning IV

palindrome-partitioning-iv

分割回文串 IV

Maximum Number of Non-overlapping Palindrome Substrings

maximum-number-of-non-overlapping-palindrome-substrings

不重叠回文子字符串的最大数目

String

Dynamic Programming

Backtracking

给你一个字符串 <code>s</code>，请你将 <code>s</code> 分割成一些 子串，使每个子串都是 回文串 。返回 <code>s</code> 所有可能的分割方案。

&nbsp;

示例 1：

<pre>
输入：s = "aab"
输出：[["a","a","b"],["aa","b"]]
</pre>

示例 2：

<pre>
输入：s = "a"
输出：[["a"]]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 16</code></li>
	<li><code>s</code> 仅由小写英文字母组成</li>
</ul>