Print all palindromic partitions of a string - Backtracking Algorithm in Java

[dhrupad17]

Is your feature request related to a problem? Please describe.

Here a String is given in Input We have to perform partitioning on the string in such a way that every part is a palindromic string itself and then we will return those parts

Describe the solution you'd like

Here through Backtracking we can recursively try over each and every partitions of the string thus Time Complexity becomes O(2*n).

Describe alternatives you've considered

Alternatively this above problem can be solved through Dynamic Programming Approach too where the time complexity will reduce to O(n^2)

Additional context
Understanding with an example

Input

bcc

Output

All Possible palindromic partitions of a string :
[[b,c,c],[b,cc]]

[github-actions]

Stale issue message