I solved a self-imposed puzzle
Puzzle is as follows:
What's the longest word (or words) that you can make solely from l33tcode digits? Namely:
- 0 = O
- 1 = L or l (but not both in the same word)
- 2 = Z
- 3 = E
- 4 = A
- 5 = S
- 6 = G
- 7 = T
- 8 = B
- 9 = nothing
I queried English lemmas from the English Wiktionary, filtered them in Python, and ended up with three 12-letter words:
Edit: Upon request:
- 458357051355
- 548074634813
- 534783171355
10 replies
You spent so long wondering if you could...
I hope not. This seems like a very obvious "must solve asap" problem.
Can confirm the problem was solved ASAP.
Do you mean 454p?
grep -i "×[olzeasgtb]+±" /usr/dict/words
The × should have been the caret, the ± should have been the dollar sign, but i don't have them on my mobile's keyboard. All from memory, maybe I'd have to escape the dollar sign.
This'll work in a pinch, but my guess is that
Category:English lemmason Wiktionary has a lot more words than/usr/dict/words. I'll have to try it to test for sure, but we keep track of some crazy obscure words (that are still attestable).Edit: For example, it lacks asbestosless, sabotageable, and seatbeltless.
Well, /usr/dict/words is just there, the wiki page is something I would have to download and probably clean up first.
You are the true 1337 H4x0r.
Show them in l33tcode too for us lazy folks!
Can't believe you didn't write them in 1337 but here you go:
-458357051355
-548074634813
-534783171355