Question $2$

Given a string $S$ of size $N$ containing lowercase English characters.

A "Dominant Sum" of a substring of $$=2$ times the frequency of the largest occurring character in the substring minus the length

of the substring.

Print the maximum dominant sum of a substring present in $S.$

Sample input:

aaacc$$

Sample Output:

$4$

N$.$B: The code must be proficient enough to handle string inputs of length up to $9,007,199,254,740,991(2^{51}-1)$ characters.