Find words whose first and last three letters are equal: Difference between revisions
Content added Content deleted
(Created page with "{{Draft task}} ;Task: Use the dictionary [https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt unixdict.txt] Find the words wh...") |
No edit summary |
||
Line 3: | Line 3: | ||
;Task: |
;Task: |
||
Use the dictionary [https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt unixdict.txt] |
Use the dictionary [https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt unixdict.txt] |
||
Find the words which first and last three letters are equals. |
<br>Find the words which first and last three letters are equals. |
||
The length of any word shown should have a length <big>'''> 5</big>. |
The length of any word shown should have a length <big>'''> 5</big>. |
Revision as of 05:25, 10 February 2021
Find words whose first and last three letters are equal is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
- Task
Use the dictionary unixdict.txt
Find the words which first and last three letters are equals.
The length of any word shown should have a length > 5.
Ring
<lang ring> load "stdlib.ring"
cStr = read("unixdict.txt") wordList = str2list(cStr) num = 0
see "working..." + nl see "Words are:" + nl
ln = len(wordList) for n = ln to 1 step -1
if len(wordList[n]) < 6 del(wordList,n) ok
next
for n = 1 to len(wordList)
if left(wordList[n],3) = right(wordList[n],3) num = num + 1 see "" + num + ". " + wordList[n] + nl ok
next
see "done..." + nl </lang> Output:
working... Words are: 1. antiperspirant 2. calendrical 3. einstein 4. hotshot 5. murmur 6. oshkosh 7. tartar 8. testes done...