In the “Print all Palindromic Partitions of a String” problem we have given a string “s”. Write a program to print all possible palindromic partitioning of s. A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as madam or racecar.
The first and only one line containing the given string “s”.
Print N lines where every line containing the partition of the string “s”. Here N is the total number of different partitions possible of string “s”.
- s[i] must be a lower English letters