String Operation

Problem Statement

String Operation Problem Description Given n strings in an array start and m strings in an array fin . You need to check whether there is a unique combination between any string from the start array and a 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 n strings of array start . The next line contains integer m. Next, m lines contain m strings of array fin . Output Format Return an array containing 'YES' or 'NO' as per the problem statement. Examples Example 1: Input: 2 aaaaa acacac 3 aabaa cccaccc caabc Output: YES NO NO Explanation: The string 'aabaa' is a unique combination of 'aaaaa'. Otherwise, none of the others make a unique combination with strings from the start array. Constraints 1 <= n <= 5*1