Humm, you didn't actually use my code. (Not that the results would be visibly different.)
Your suggestion to remove the offending letters is broken if said letters can appear anywhere but the beginning and end of the string. "AAAGNTTT" should give "AAA", "TTT", but you're algorithm would give "AAA" and "GTT".
In reply to Re^3: How can I get correct result in counting 3-letter words?
by ikegami
in thread How can I get correct result in counting 3-letter words?
by supriyoch_2008
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |