Skip to content

Conversation

@bracteatus
Copy link
Contributor

Solved #1 using shift and unshift to manage the generation of the Van Eck series.
Solved #2 by finding the longest word that is composed entirely of the postal abbreviations.

Using only the official postal abbreviations for the 50 U.S. states, write a script to find the longest English word you can spell.
Shift the Van Eck sequence to prepare $a_{n+1}$ knowing $a_n$.
Find longest word within the range composed by the postal codes.
@manwar manwar merged commit 4b2b60a into manwar:master Jun 27, 2019
robbie-hatley pushed a commit to robbie-hatley/perlweeklychallenge-club that referenced this pull request Feb 17, 2025
manwar added a commit that referenced this pull request Feb 18, 2025
Robbie Hatley's solutions, in Perl, for The Weekly Challenge #309.
2colours added a commit to 2colours/perlweeklychallenge-club that referenced this pull request Feb 20, 2025
manwar added a commit that referenced this pull request Feb 20, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants