Count All Matches
March 10, 2015
Count All Matches
Today’s exercise is an interview question from Google, as reported at Career Cup:
Given two strings, find the number of times the first string occurs in the second, whether continuous or discontinuous. For instance, the string CAT appears in the string CATAPULT three times, as CATapult, CAtapulT, and CatApulT.
Your task is to write the indicated program. When you are finished, you are welcome to read or run a suggested solution, or to post your own solution or discuss the exercise in the comments below:
Programming Praxis 