PWC 231

PWC 231

Two easy challenges this week. It is tempting to try them in Perl 5, Raku as well as Julia, but alas, I don't have the time. So here goes Perl 5 only.

Challenge 1 (Min Max)

We are given a list of distinct integers and asked to return the elements that are neither the maximum nor the minimum. If there are no such elements, then return -1. That happens if the list length is 2 or less, in which case every element is perforce either a maximum or minimum or both.

I sort the list and return the elements between the head and the tail. I use PDL.

Here is the key subroutine:

sub min_max {    
    my $ints=pdl(@_)->uniqvec;
    ($ints->dim(0) > 2) ?
        ($ints->qsort->(1:(($ints->dim(0))-2))) :
        (-1);
}

Just in case the input is not a list of distinct integers, I force it to its unique elements using the PDL uniqvec method. I then check if the length is 2 or less, in which case we return -1, else we sort and return the sub-piddle between the head and tail.

Challenge 2 (Senior citizen)

We are given a list of strings where every string is in the format "#########<####" (the first 10 digits representing a phone number, 1 alphanumeric (presumably either 'M' or 'F') denoting sex, and 4 digits, the first two of which represent age, and the last two represent a seat number).

We are asked to count the number of elements that represent an age greater than or equal to 60.

One can use grep to extract and count the strings with ages greater than or equal to 60. Just in case, we can also check that each string is in the correct format using a regex. Here is the subroutine:

sub senior_citizens {
    #
    #-- helper sub sub
    local *validate_input = sub {
        $_[0] =~ m/^\d{10}[MF]{1}\d{4}$/;
    };
    #
    #-- back to trunk of sub
    scalar
    grep
    {
        (&validate_input($_)) &&
        (substr($_,11,2) >= 60);
    }
    @_;
}

A more idiomatic approach would be to avoid the &validate_input sub-subroutine, and directly put the regex into the grep as in:

    scalar grep
    {
        (m/^\d{10}[MF]{1}\d{4}$/) &&
        (substr($_,11,2) >= 60);
    }
    @_;

I realized while typing that that the two conditions can be combined. We can just check that the 11th position in the regex is a number in [6-9] like:

     scalar grep /^\d{10}[MF]{1}[6-9]{1}\d{3}$/, @_;

I kinda like sub-subroutines though, and it is more readable with one. So I will leave my original code as is. Also the sub-subroutine can easily be extended to throw an exception if invalid input is encountered. That is not so easy with the compact one-liner just above.

Comments

Post a Comment

Popular posts from this blog

PWC 258

PWC 258 Last week (#257) I finished challenge 2 and my blog post for challenge 257 late last week, so had only submitted challenge 1. Here is my blog post for PWC 257 , including the full code for my challenge 2 solution. This week, I have done both challenges in perl 4.019 on DOSBOX. Both scripts also work fine on the latest Perl 5.38. I also did the challenges in Raku, where they are one-liners.  Challenge 1 (Count Even Digits Number) We are given a list of integers, and asked to count the number of elements whose base-10 representation has an even number of digits. In Raku , this is a one-liner. Here it is: raku -e 'say +@*ARGS.grep({$_.chars %% 2})' $@ It could be a one-liner in Perl 4 too, but since I run it on DOSBOX, my script would not be a bash shell script. Here is the short subroutine that does the job.  sub count_even_digits {  scalar( grep( ((length($_) % 2) == 0), @_) ); } The full code is here . Challenge 2 (Sum of values) We are given an integer k  and a list in
Read more

PWC 249

PWC 249 Challenge 1 (Equal pairs) We are given a list of integers with an even number of elements. We are asked to check if the list can be completely divided into sub-lists of size 2 with each sub-list containing the same integer repeated, like say (2,2). If so, we are asked to return the list of such sub-lists. This is straightforward in Perl 5. I use modern conveniences this time, though it could be done using only primitive Perl 4 syntax. Here is my subroutine. It returns a list of array references. local *equal_pairs = sub {     #-- return () if input is of odd length     ((scalar(@_) % 2) > 0) && (return ());          #-- count number of occurrences of each element using a hash     local %_ = ();     map {$_{$_}++} @_;          #-- if any element occurs an odd number of times, return ()     (grep {($_{$_} % 2) > 0} keys %_) && (return ());          #-- loop thru %_ keys, returning pairs of such keys     map {         my $k=$_;         my $num_pairs=( ($_{$k}
Read more

PWC 253

PWC 253 I do both challenges this week using old software on DOSBOX: perl 4.019, and for comparison, also python 1.4 beta. My solutions also work on the current versions of Perl 5 (5.38) and Python 2 (2.7.18) respectively. Challenge 1 (Split Strings) Links to code: perl4.019 python1.4b We are given a list of strings, and a single character say sep . We are asked to return the list, with the strings split into component substrings using sep as a separator. We should not include any empty strings in the output. In perl 4, I first stick a backslash in front of the separator character, so that it is escaped if entered in a regex. This is because the perl split function takes a regex as its first argument indicating the separator. If we have a character like '$' or ',', we want to escape it so that it is read literally when parsing the regex. Here is the key subroutine:   sub split_strings {  local ($separator, @words)=@_;  local (@retval)=(); #array to be returned  #  #--
Read more