Add palindrome partition solution

Add the code for palindrome partition problem.

The code should be added at code/dynamic_programming/palindrome_partition

Problem statement: Given a string s, determine the minimum number of cuts necessary to partition s in a set of palindromes. For example, for string aaabbba, minimum cuts needed is 1, making aa | abba. Expected time complexity: O(n^2), where n is the size of s