December 9th, 2012, 11:34 AM
Join Date: Nov 2012
Time spent in forums: 22 m 22 sec
Reputation Power: 0
Simple Regular Expression searching for all two-letter clusters
Hi, I have a string of random characters represented below:
text = "iemndcidpwpkeejjslsdjnnvdjsskeelxkjwnsnejxx"
I'm looking for a regular expression that will find all the two-letter character clusters within the above string. In other words, my ideal generated list would be as follows:
['ie','em','mn','nd',...] et cetera.
My code so far is this:
However, upon executing this, the resulting list generated is this:
There is no overlap! I'm looking to find a way to include every two-letter character within my Regular Expression.
Any help would be greatly appreciated!
Thanks so much.