DSAGeeks
Palindrome Partitioning Recursive
Hard

Problem Statement

Given a string, find the minimum number of cuts required to partition it into palindromic substrings using recursion.

Examples

1Example 1
Input:
{ "s": "aab", "i": 0, "j": 2 }
Output:
1
2Example 2
Input:
{ "s": "a", "i": 0, "j": 0 }
Output:
0
3Example 3
Input:
{ "s": "abcbm", "i": 0, "j": 4 }
Output:
2
Loading...

Sign in to Run Code and Submit