CT077

Professor Byte’s Palindrome Workshop

HardL8 · Quantum CoderAcceptance: 0.0%XP: 250

Professor Byte cuts a string into the fewest palindromic pieces. Report that minimum number of pieces. Input: one lowercase string. Output minimum number of palindromic substrings covering it.

Example 1:

Input: aab
Output: 2

Example 2:

Input: racecar
Output: 1

Example 3:

Input: abc
Output: 3

Constraints:

1≤length≤3000.

Tags:

strings dynamic-programming palindrome
Loading...
Test Cases:No test cases
No test cases available.