Write a method (in a language that you are comfortable with) that determines whether one given string is a substring of another given string.
Sigiloso
Given S1 = the main string S2 = the string to check in S1 I did this in O(n) time by reevaluating S2 while walking through S1 one time. So, start at the first character of S1, and check whether this is the first character of S2, then the second character and so on. If they are the same until S2.length, then it is a substring, if not start over with the first character of S2 and keep going.