Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the length of both strings s and pwill not be larger than 20,100. The order of output does not matter.
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. For example, given s ="aab",Return [ ["aa","b"], ["a&