>>Thanks to all (Dragan, Marcia and Tore). I wonder which solution is the fastest?
>>
>>Since you have all the code, why don't you test all the solutions and let us know?
>
>(Edit: This reply is for Yossi)
>
>I think Dranag's solution is the fastest and optimal, because analyze the string only once and using the minimal instruction set.
>
Imagine tcBig 650KB long with 10000 "A": the check will be done 10000 times,
If the "A" is at the end of the resulting string, will take longer ;-)))