$solution ~~ m:g/../
$solution.comb(2) # much faster
$a % 2 == 0
$a %% 2 # clearer
]]>
One of the optimization I made is to do it backwards.
Generate list of names ending with a letter which is NOT a starting letter of any name in the whole pokemon name list. These will be the last name candidates
The last name candidates can be further reduced by getting the name with most number of branching (its first char is same as last char of name in pokemon name list)
This will result in fewer starting points, and will reduce recursions.
]]>-Yet
]]>OK!
If I and you are lazy, we don't want to learn a lot of syntax.
It would be nice to add a grammar that is just the right size for convenience and less learning.
And
Perl have a history and Perl users on Unix/Linux and Text Processing have long convention.
I hope well balanced choice instead of all possible features.
These effect PHP, Python, TypeScript.
On the other hand, there are long time Perl users(which contain me) expect and feel attractive that Perl is pure dynamic language in core features.
1 x_1 y_1
1 x_2 y_2
1 x_3 y_3
like this
Some other people such as Dave Jacoby had examples like this:
where he seemed to think that they were collinear.
]]>