String Matching

In this problem we will have a few definitions as described below: - Binary string: A string containing only characters '0' and '1'. - Hamming distance of the two binary string of the same length is the number of the positions where the two strings have different characters. eg. the hamming distance of "01010101" and "00110111" is 3, the hamming distance of a binary string with itself is 0. - S