Palindrome Partitioning

You are given a string s.
Your task is to split s into all possible combinations where every substring in the partition is a palindrome (reads the same backward as forward).
Return a list of all valid palindrome partitions of s.
Each partition should be represented as a list of strings.