# Leetcode 131 - Palindrome partitioning

Note:

• This is a backtracking problem.
• Need a helper isPalindrome
• We need to pass a param startIndex as usual, and [startIndex, i] is just what we got by spliting.

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

A palindrome string is a string that reads the same backward as forward.

Example: