Minimize replacements by previous or next alphabet required to make all characters of a string the same
Given a string S of length N consisting of lowercase alphabets, the task is to find the minimum number of operations required to make all the characters of the string S the same. In each operation, choose any character and replace it with its next or previous alphabet.
Note: The alphabets are considered to be cyclic i.e., Next character of z is considered to be a and previous character of a is considered to be z.
Input: S = “abc”
To minimize the number of operation change all characters of the strings to ‘b’.
Operation 1: Change a to b.
Operation 2: Change c to b.
Input: S = “zzza”
To minimize the number of operation change all characters of the strings to ‘z’.
Operation 1: Change a to z.
Approach: To solve the problem, the idea is to calculate the cost of making all the characters equal to each alphabets, ‘a’ to ‘z’, one by one and print the minimum cost required for any of the conversions. Follow the steps below to solve the problem:
- Initialize the variable min with a large value which will store the minimum answer.
- Traverse over the range [0, 25] where i represent (i + 1)thalphabet from ‘a’ to ‘z’ and perform the following steps:
- Initialize variable cnt initialized as 0 which will store the answer to convert all character of string same.
- Traverse the given string from j = 0 to (N – 1) and add min(abs(i + ‘a’ – S[j]), 26 – abs(i + ‘a’ – S[j])) into cnt.
- After the above step, update min to a minimum of min and cnt.
- After traversing the string for each character, print the value of min as the minimum count of operations.
Below is the implementation of the above approach:
Time Complexity: O(N * 26)
Auxiliary Space: O(N)