Chapter number or note title: [Dynamic Programming]
Page number: [Exercises question 9 (About finding palindromic partitioning of a string)]
Error description: [The example in part (e) which says "Given the string BUBBASEESABANANA, your algorithm should return
70." The answer To this is actually 97 (Verified by both DP and Brute force solutions). I also printed all the 97 ways of partitioning the string to verify this.]
Chapter number or note title: [Dynamic Programming]
Page number: [Exercises question 9 (About finding palindromic partitioning of a string)]
Error description: [The example in part (e) which says "Given the string BUBBASEESABANANA, your algorithm should return 70." The answer To this is actually 97 (Verified by both DP and Brute force solutions). I also printed all the 97 ways of partitioning the string to verify this.]
Suggested fix (if any): [Change 70 to 97.]