package leetcode;

/**
 * https://leetcode.com/problems/palindrome-partitioning-ii/
 */
public class Problem132 {
    public int minCut(String s) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem132 prob = new Problem132();
    }
}

@@ -271,16 +271,239 @@
 m132();%0A
+        System.out.println(prob.minCut(%22aab%22)); // 1%0A        System.out.println(prob.minCut(%22aaa%22)); // 0%0A        System.out.println(prob.minCut(%22bbaaaaabb%22)); // 0%0A        System.out.println(prob.minCut(%22baaaaabb%22)); // 1%0A
     %7D%0A%7D%0A

Update problem 132