String Operation

Problem Statement

String Operation Problem Description You are given an array start of n strings and a different array fin of m strings. Every string is made up only of the characters 'a' , 'b' and 'c' . For the i -th string of fin , check whether it forms a unique combination with some string from start . Two strings form a unique combination when both of these are true: they have the same length, and they differ in exactly one position. Return an array of length m holding "YES" or "NO" for every string in fin , in the same order as fin . Implement the function: stringOperation(start, fin) Input Format The first line contains the integer n . Each of the next n lines contains one string of the array start . The next line contains the integer m . Each of the next m lines contains one string of the array fin . Output Format Print m lines. The i -th line is YES if the i -th string of fin forms a unique combination with at least one string of start , and NO otherwise. Print the words in uppercase exactly as