java.lang.Object
g0101_0200.s0131_palindrome_partitioning.Solution

public class Solution extends Object
131 - Palindrome Partitioning.<p>Medium</p> <p>Given a string <code>s</code>, partition <code>s</code> such that every substring of the partition is a <strong>palindrome</strong>. Return all possible palindrome partitioning of <code>s</code>.</p> <p>A <strong>palindrome</strong> string is a string that reads the same backward as forward.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;aab&rdquo;</p> <p><strong>Output:</strong> [[&ldquo;a&rdquo;,&ldquo;a&rdquo;,&ldquo;b&rdquo;],[&ldquo;aa&rdquo;,&ldquo;b&rdquo;]]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;a&rdquo;</p> <p><strong>Output:</strong> <a href="&quot;a&quot;">&quot;a&quot;</a></p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 16</code></li> <li><code>s</code> contains only lowercase English letters.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details