The Runtime Theory
mediumLeetCode#backtracking#palindrome

Palindrome Partitioning

Return every partition of a string where each selected substring is a palindrome.

The Runtime Theory Team25 min read
Solve it

Solving happens on the judge — come back and mark it done

Sample cases

ins="aab"

out[["a","a","b"],["aa","b"]]

ins="a"

out[["a"]]

ins="abba"

outpartitions include ["abba"] and ["a","b","b","a"]

Return every partition of a string where each selected substring is a palindrome.

A good solution should

  • State the invariant or decision rule that makes the approach correct.
  • Explain time and space costs in terms of input size and required output.
  • Handle empty, minimal, duplicate, and boundary-shaped inputs.

Reasoning prompt

At each start index, try palindromic prefixes and recurse on the suffix. Precompute palindrome ranges if repeated checks dominate.

Use the linked judge for the canonical challenge. The examples above are compact TRT checks; create additional tests around the boundary most likely to break your invariant.

More practice in this topic

medium · backtrackingCombination Sum IImedium · backtrackingCombination Summedium · backtrackingLetter Combinations of a Phone Number

One dispatch a week

The trace behind each problem, the tradeoff that explains it, and one technical dispatch per week — no noise.

One technical dispatch per week. No noise.

Not started

Sign in to save your learning progress.

Sign in to save