Welcome to Day 16 of the DSA Coding Challenge:

Today's Goals (Dynamic Programming continued) :

Question 1: Palindrome Partitioning: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

Question 2: Palindrome Partitioning 2: 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. s will not be an empty string

All the best !