PWC 229

PWC 229

Challenge 1 (Lexicographic Order)

We are given a list of strings. We are asked to count the number of elements that are strings whose constituent characters are not all either in weakly monotonically ascending lexicographic order or weakly monotonically descending lexicographic order (i.e., component strings whose characters are NOT either all in ascending or all in descending dictionary order).

I use a sub-subroutine &is_sorted that checks if each string is sorted. If the string has less than 3 elements, then it is automatically sorted. Otherwise, we check the order of the first 2 elements, say either element 1 is (lexical) less than or equal to (le) element 2, or element 1 is greater than or equal to (ge) element 2. We proceed to loop through the remaining elements to verify that they have the same ordering relationship (le or ge) as the first two.

In the main part of the subroutine, we call &is_sorted on each string in the array (map), then extract the zeroes (not sorted) in the resulting array (grep), and return the length of the array of extracted zeros (scalar). 

Here is the subroutine:

sub lexicographic_order {
    #-- helper subroutine
    
    local *is_sorted = sub {
        my ($str)=@_;
        
        (length($str) < 3) && (return 1);
        
        my $op;
        ( substr($str,0,1) le substr($str,1,1) ) ?
        ($op = 'le') : ($op = 'ge');
        
        INSTRING: for my $x (2 .. (length($str)-1)) {
            my $test = ('\''. substr($str,$x-1,1) .'\' '. $op .' \''. substr($str,$x,1).'\'');
            
            unless (eval($test)) {
                return 0;
                last INSTRING;
            }
        }
        1;
    };
    
    
    #-- main trunk of subroutine
    my @str = @_;
    scalar grep /0/, map {&is_sorted($str[$_])} 0 .. $#str;
}

Challenge 2 (Two out of three)

We are given three arrays (presumably 3 arrayrefs in Perl 5). We are asked to extract a list of items that are elements of at least two out of the three arrays.

My solution is probably not the most efficient. I use three hashes to record membership in each of the three arrays. Then I use another hash %two_out_of_three to count elements in at least two out of three arrays. I loop through the keys of the membership hashes for the first two arrays in the input, recording in %two_out_of_three which of the keys also exists in one or both of the other membership hashes. Finally, we return the keys of %two_out_of_three.

Here is the subroutine:

sub two_out_of_three {
    #-- helper sub sub
    local *in_arry = sub {
        local @in_arry=@_;
        local %in_arry;
      
        map {
            $in_arry{$_}=1;
        } @in_arry;
        %in_arry;
    };
    
    #-- main trunk of sub
    my ($ra1, $ra2, $ra3)=@_;
    
    my %rh1 = &in_arry($ra1->@*);
    my %rh2 = &in_arry($ra2->@*);
    my %rh3 = &in_arry($ra3->@*);
    
    my %two_out_of_three;
    
    map {( (exists $rh2{$_}) || (exists $rh3{$_}) ) &&
     ($two_out_of_three{$_}=1);} keys %rh1;
    map {( (exists $rh1{$_}) || (exists $rh3{$_}) ) &&
     ($two_out_of_three{$_}=1);} keys %rh2;

    keys %two_out_of_three;
}

I probably should have called the membership hashes %hash1, %hash2, etc., rather than %rh1, %rh2, etc. since I usually use the rh prefix as Hungarian notation to signify a hashref. I'll leave this minor inconsistency. 

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  an...
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

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 %_) &&...
Read more