Given a string, divide it into two substrings such that the substrings have the most possible characters in common. The cut commonality is number of characters in common between the two substrings. Determine the maximum cut commonality. Determine the maximum cut commonality. For example, given a string, s="abcdedeara", there are 9 ways of splitting the string into two non-empty substrings. The best possible way is to split it into "abcde" and "deara" which gives the cut commonality of 3 with 1 each for a, d and e. If a character is repeated, the cut commonality count for that character is the minimum of the count of that character in the two substrings. Given the original string "aabbbbaa", the best split is "aabb" and "bbaa" and the cut commonality is 4 with 2a's and 2b's. S.no 0 1 2 3 4 5 6 7 8 $1 a ab abc abcd abcde abcded All possible cuts of the given string abcdede abcdedea abcdedear $2 bcdedeara cdedeara dedeara edeara deara eara ara ra a Cut Commonality 1 a: 1 1 a: 1 1 a: 1 2 a: 1,d: 1 3 a: 1,d: 1,e: 1 2 a: 1,e: 1 1 a: 1 1a:1 18:1