Palindrome Partitioning (Backtracking)

String:

Recursive DFS: Check if substring s[i...j] is palindrome, then recurse.

Check Substring

Recurse

Solution Found

Found Partitions

當前步驟

Ready.

步驟 0 / 0

速度:

邏輯解釋

Backtracking Code