String Operation

Problem Statement

String Operation Problem Description Given n strings in an array start and a different array fin containing m strings. You need to check whether there is a unique combination between any string from the array start and i th string from fin . A unique combination is when both strings have the same length and differ in exactly one position. The string contains a combination of 'a', 'b', and 'c'. Return an array of length m , which returns 'YES' or 'NO' for every string in fin . Input Format The first line contains the integer n . Next, n lines contain an i th string of array start . The next line contains integer m . Next, m lines contain an i th string of array final . Constraints 1 <= n <= 5*10 3 1 <= m <= 5*10 3 Output Format Return an array containing 'YES' or 'NO' as per the problem. vector<string> stringOperation(vector<string> start, vector<string> fin) { // Write your code here }