Find all palindromic decompositions of a given string s. A palindromic decomposition of string is a decomposition of the string into substrings, such that all those substrings are valid palindromes. Also seen as: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partioning of s.
Book mock interviews with engineers from Google, Facebook, Amazon, or other top companies. Get detailed feedback on exactly what you need to work on. Everything is anonymous, and you don't have to until you find a job.