Tessellate S.T.E.M.S. (2019) - Computer Science - School - Set 2 - Objective Problem 4
The palindromic count of a string is defined as the count of the number of substrings of a string which are palindrome. For example, the palindromic count of “abc” is 3, whereas the palindromic count of “aaa” is 6.
What is the maximum possible palindromic count among all
the permutations of “TESSELLATE”?
This problem is a part of Tessellate S.T.E.M.S (2019)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!