Find Maximum Score

This test case was added on 06-05-2025. It was shared by a user friend in the Solution section, and I happen to come across it. I don’t know who you are, but thank you so much for sharing something so helpful! As alaways, relevant source ss is included in the Problem Source section :) The initial score is 17, one point for each of the 8 letters, and the following 9 substring contributing one point each: 'aa', 'ab', 'ba', 'aab', 'aba', 'aaba', 'fg', 'gh', 'fgh'. In the optimal scenario, change the character at the 5th position Le., data[4] = 'c'to 'b'. The string data becomes "aababfgh" and the score is thus calculated as: 1 point for each of the 8 letters of the string. The following substrings worth 1 point each: data[0:1] = "aa", data[0:2] = "aab", data[0:3] = "aaba", data[0:4] = "aabab". Total count = 4. data[1:2] = "ab", data[1:3] = "aba", data[1:4] = "abab". Total Count = 3. data[2:3] = "ba", data[2:4] = "bab". Total count = 2. data[3:4] = "ab". Total count = 1. data[5:6] = "fg", data[5:7] = "fgh", Total count = 2. data[6:7] = "gh". Total count = 1. Therefore, the total points is 8 +4+3+2+1+2+1=21. Hence, the answer is 21.

This test case was added on 06-05-2025. It was shared by a user friend in the Solution section, and I happen to come across it. I don’t know who you are, but thank you so much for sharing something so helpful! As alaways, relevant source ss is included in the Problem Source section :) The string is already in one of its most efficient forms, so no changes can increase Its score. A point is scored for 'a', 'b', 't,b Show Applications abc', 'bcb', and 'abcb'.

"abez" to "abaz" Each of the substrings is worth 1 point. Hence, the final answer is 7.