Implement Palindrome Partitioning algorithm

[KomoderHell]

Aim

To implement an algorithm that gives, the minimum no. of partitions you will have to do in a string, such that each resultant sub string will be a palindrome.

ex: for a given string S: "NITIK" we can do the partition as - N | ITI | K thus, output will be "2" (without quotes)

PS: I will be working on the implementation

[Ritikjain999]

Hey! I would like to work on this issue please assign it to me