Binary Pattern Search in Java

 You have a given two string pattern and s(word). The first string pattern contains only the symbols 0 and 1 and the second string s contains only lowercase english letters.Lets's say that pattern matches a substring s[1..r] or s if the following 3 conditions are met:they have equal lengthfor each...