Substring algorithm

Question

Can someone explain to me how to solve the substring problem iteratively?

The problem: given two strings S=S₁S₂S

Answer 1

// runs in best case O(n) where no match, worst case O(n2) where strings match

var s = "hippopotumus"
var t = "tum"

for(var i=0;i