Skip to content

Latest commit

 

History

History
14 lines (10 loc) · 374 Bytes

File metadata and controls

14 lines (10 loc) · 374 Bytes

Problem 10: The Partition Artist (Palindrome Partitioning)

Problem Statement

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

Input Format

  • A string s.

Constraints

  • 1 <= s.length <= 16

Example

Input: s = "aab"
Output: [["a","a","b"],["aa","b"]]