ye olde longest common substring algorithm for javascript This algorithm works by caching the number of common characters found up to a given point in a two dimensional array. It returns the set of ...

The problem with your latter post is that indexOf returns (-1) when the substring is not found. <BR><BR>-1 == true<BR><BR>Instead test if the indexOf ("index2.htm") > -1.