O67

Palindrome Partitioning

Mid / Senior Engineer
Target Time: 25 - 35 Minutes
Type: ARRAY

Problem Statement & Objective

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

Function Signature (Python)

partition_palindromes(s: str) -> list[list[str]]

Input & Output Contract

Output Rule:Palindromik parçaların oluşturduğu bölümleme listesi.

System Constraints

1 <= s.length <= 16
s yalnızca küçük İngilizce harfler içerir

Example Execution Walkthrough

s = 'aab' -> [['a', 'a', 'b'], ['aa', 'b']]

Example Test Scenarios (3)

Example 1
Input:["aab"]
Expected Output:[["a","a","b"],["aa","b"]]
Example 2: Tek Harf
Input:["a"]
Expected Output:[["a"]]
Example 3
Input:["aba"]
Expected Output:[["a","b","a"],["aba"]]
Loading Python Editor...
Input Parameters
[
  "aab"
]
Expected Output
[
  [
    "a",
    "a",
    "b"
  ],
  [
    "aa",
    "b"
  ]
]