Everything is a palindrome
Computer Science Level 4Any string can be imagined as a sequence of palindromes because one letter strings are technically palindromes. Let \(\text{PalComp}(s)\) be the minimum number of palindromes from which \(s\) can be constructed. What is the value of \(\text{PalComp}(s)\) of the following
1 

Examples
 \(\text{PalComp}\)("dadofanna") = \(4\) since "dadofanna"\(=\) "dad" \(+\) "o" \(+\) "f" \(+\) "anna".
Your answer seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
Already have an account? Log in here.