C#

Luc Pattyn wrote:

It might be improved by looking for the last subitem using LastIndexOf

Luc Pattyn wrote:

So, yes PIEBALD's approach is a correct one and possibly the best

Luc Pattyn wrote:

cSearch=search[iSearch++];

foreach(string s in stringCollection) {
    int i2=s.IndexOf('2');
    int i4=s.IndexOf('4');
    if (i2>=0 && i2<i4) output("match: "+s);
}

foreach(string s in stringCollection) {
    int i24=s.IndexOfAny('2','4');
    if (i24>=0 && s[i24]=='2') output("match: "+s);
}

bool seen2=false;
foreach(char c in s) {
    if (c=='2') seen2=true;
    else if (c=='4') return seen2;
}
return false;

bool seen2=false;
foreach(char c in s) {
    if (c=='2') seen2=true;
    else if (c=='4' && seen2) return true;
}
return false;