Minimum contrast

Problem Statement

Minimum contrast Problem Description Given a set of n strings S_1, S_2, ..., S_n and q queries Q_1, Q_2, ..., Q_q . In each query, you are given a string (which may or may not be present in the previous input). You have to print that string from the set of n strings which is at the minimum distance from the string given in the query. Distance between two strings is the minimum number of insertion, deletion, and replacement operations required to make one string exactly equal to the other string. In case there are 2 strings that have the same distance to the string given in the query, print the string that is earlier in the input. For each query, print that string from the set of n strings which is at the minimum distance from the string given in the query. Function Description Complete the function MinimumContrast . This function takes the following 4 parameters and returns a vector of strings: n : Represents the number of strings S : Represents the array of strings of size n q : Repre