1) Generate two random strings of characters over the alphabet {E,T,H,G,B,_}, one string Sa of length 250 and one string Sb of length 150.
2) write a regex program that finds the two substrings of length 50 in Sa and Sb which have the highest percentage of matches between letters. Only absolute matches are allowed - E matches E, _ matches _, etc.
Your code will be reviewed by Bill Mann, who will either nod in approval or gently point out that the length of your instruction path can be reduced by at least one order of magnitude.