# coding=utf-8
import unittest

"""132. Palindrome Partitioning II
https://leetcode.com/problems/palindrome-partitioning-ii/description/

Given a string _s_ , partition _s_ such that every substring of the partition
is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of _s_.

**Example:**

    
    
    **Input:**  "aab"
    **Output:** 1
    **Explanation:** The palindrome partitioning [ "aa","b"] could be produced using 1 cut.


Similar Questions:
  Palindrome Partitioning (palindrome-partitioning)
"""


class Solution(object):
    def minCut(self, s):
        """
        :type s: str
        :rtype: int
        """
        

    def test(self):
        pass


if __name__ == "__main__":
    unittest.main()
