# Find the Mid-Alphabet for each index of the given Pair of Strings

Given two same-length strings str1 and str2 consisting of lowercase English alphabets, the task is to find the Mid-Alphabet for each index of the given pair of Strings.

Examples:

Input: str1 = “abcd”, str2 = “cdef”
Output: bcde
Explanation:
b is mid of a and c
c is mid of b and d
d is mid of c and e
e is mid of e and f

Input: str1 = “akzbqzgw”, str2 = “efhctcsz”
Output: chqbrnmx

Approach:
The Mid-Alphabet can be calculated by taking an average of the ASCII values of the characters in each string at that index.

$\LARGE&space;{\color{DarkGreen}&space;midAlphabet_i&space;=&space;\frac{(ASCII(str1[i])&space;+&space;ASCII(str2[i]))}{2}}$

Below is the implementation of the above approach:

## C++

 // C++ program to find the Mid-Alphabet// for each index of the given Pair of Strings #include using namespace std; // Function to find the mid alphabetsvoid findMidAlphabet(string s1, string s2, int n){     // For every character pair    for (int i = 0; i < n; i++) {         // Get the average of the characters        int mid = (s1[i] + s2[i]) / 2;        cout << (char)mid;    }} // Driver codeint main(){     string s1 = "akzbqzgw";    string s2 = "efhctcsz";    int n = s1.length();     findMidAlphabet(s1, s2, n);     return 0;}

## Java

 // Java program to find the Mid-Alphabet// for each index of the given Pair of Stringsclass GFG{ // Function to find the mid alphabetsstatic void findMidAlphabet(String s1,                            String s2, int n){     // For every character pair    for (int i = 0; i < n; i++)    {         // Get the average of the characters        int mid = (s1.charAt(i) +                    s2.charAt(i)) / 2;        System.out.print((char)mid);    }} // Driver codepublic static void main(String []args){    String s1 = "akzbqzgw";    String s2 = "efhctcsz";    int n = s1.length();     findMidAlphabet(s1, s2, n);}} // This code is contributed by Rajput-Ji

## Python3

 # Python3 program to find the Mid-Alphabet# for each index of the given Pair of Strings # Function to find the mid alphabetsdef findMidAlphabet(s1, s2, n):     # For every character pair    for i in range(n):         # Get the average of the characters        mid = (ord(s1[i]) + ord(s2[i])) // 2        print(chr(mid), end = "") # Driver codes1 = "akzbqzgw"s2 = "efhctcsz"n = len(s1) findMidAlphabet(s1, s2, n) # This code is contributed# by Mohit Kumar

## C#

 // C# program to find the Mid-Alphabet// for each index of the given Pair of Stringsusing System;     public class GFG{  // Function to find the mid alphabetsstatic void findMidAlphabet(String s1,                            String s2, int n){      // For every character pair    for (int i = 0; i < n; i++)    {          // Get the average of the characters        int mid = (s1[i] +                    s2[i]) / 2;        Console.Write((char)mid);    }}  // Driver codepublic static void Main(String []args){    String s1 = "akzbqzgw";    String s2 = "efhctcsz";    int n = s1.Length;      findMidAlphabet(s1, s2, n);}} // This code contributed by Rajput-Ji

## Javascript

 

Output:
chqbrnmx

Time Complexity: , where N is the length of the String.
Auxiliary Space: O(1), no extra space is required, so it is a constant.

Previous
Next