This process only needs to identify 1 word in the list that meets the criteria resulting in a unique list of the words that were contained within other words.
I suppose there would still be a problem if this process doesn't look at the words that preceed each word because something could be missed.
I have this code working and it sure is fast at producing a list of words. It just needs to return 1 word instead of all of the words that match and ensure that it searches the entire list.
Thank you!In reply to Re^4: Words in Words
by sarchasm
in thread Words in Words
by sarchasm
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |