# Palindrome Partitioning IV: Study Guide

Palindrome Partitioning IV shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return whether s can be split into exactly three palindromic substrings. Precompute isPal[i][j], then try cuts i < j such that s[:i+1], s[i+1:j+1], and s[j+1:] are all palindromes.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2).

## Common mistake

Searching for any number of palindrome parts (that is partitioning I) instead of exactly three.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.