private  boolean isPalindrome(String str, int r, int t) {
        while(r < t) {
            if (str.charAt(r) != str.charAt(t)) {
                return false;
            }
            r++;
            t--;
        }
        return true;
    }
Given a string s, partition s such that every substring of the partition is a palindrome.
https://leetcode.com/problems/palindrome-partitioning/
src/com/interview/dynamic/PalindromePartition.java