Your program will accept two separate unsorted input files of strings as input. Each string is separated by EOL. Load all strings from first file into a Hash data structure with (key=string, value=line number). Then load all strings from second file into a second Hash data structure with (key=string, value=line number).Find the all the different strings that occur in the first file and do not occur in the second file. Return the line number of missing strings of the first file. Print the output to a file.
Your program will accept two separate unsorted input files of strings as input. Each string is separated by EOL. Load all strings from first file into a Hash data structure with (key=string, value=line number). Then load all strings from second file into a second Hash data structure with (key=string, value=line number).Find the all the different strings that occur in the first file and do not occur in the second file. Return the line number of missing strings of the first file. Print the output to a file.