Given string s consisting of only A’s and B’s. You can transform the given string to another string by toggling any character. Thus many transformations of the given string are possible. The task is to find the Weight of the maximum weight transformation.
The weight of a string is calculated using the below formula.
Input: s = "AA" Output: 3 Explanation: Transformations of given string are "AA", "AB", "BA" and "BB". Maximum weight transformation is "AB" or "BA". And weight is "One Pair - One Toggle" = 4-1 = 3.
Input: s = "ABB" Output: 5 Explanation: Transformations are "ABB", "ABA", "AAB", "AAA", "BBB", "BBA", "BAB" and "BAA" Maximum weight is of original string 4 + 1 (One Pair + 1 character)
You don't need to read input or print anything. Complete the function
getMaxWeight() which takes string s as input and return an integer
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(N)
1 ≤ N ≤ 105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes