PWC 189

PWC 189

Challenge 1 (Greater Character)

"You are given an array of characters (a..z) and a target character. Write a script to find out the smallest character in the given array lexicographically greater than the target character."

I sort the list. Then, in Perl 5 and Julia, I loop through the sorted elements until I hit one just bigger than the target. In Raku, I just use grep.

Here is the key snippet from my Raku script:

@arry.sort({$^a cmp $^b}).grep({$_ gt $target}).min;

Challenge 2 (Array Degree)

"You are given an array of 2 or more non-negative integers. Write a script to find out the smallest slice, i.e. contiguous subarray of the original array, having the degree of the given array."

The degree of the array is the maximum frequency with which any element occurs. Thus for the example given (1,3,3,2), the degree is 2 (the frequency of the most common or modal element 3).

The smallest slice with the same degree is the smallest slice containing every occurrence of the modal element. This would be the slice that starts with the first and ends with the last occurrence of the modal element: (3,3) in the above example.

There could be multiple modal elements, in which case there could be multiple slices returned.

For my Perl 5 script, I decided to restrict it to the core syntax inherited from Perl 4. I call a subroutine smallest_slice_with_same_degree that returns a list of strings, each of which is an expression of the form @arry[first_index .. last_index]. These have to be eval'd, so I also include a wrapper function print_smallest_slice, which evals and prints the output from smallest_slice_with_same_degree.

The Perl 5 script is fast, running the examples in around 0.007 seconds. This is not much slower than the executable from Ali Moradi's C program which ran in 0.002 seconds on my hardware.

My Raku and Julia scripts mimic the Perl 5 logic, but of course are more modern. The Raku script directly returns the list of slices (no pseudo-closure) as an array of arrays. The Julia script just prints the output directly from the subroutine rather than returning the value. Both scripts are slower than the Perl 5 script at around 0.46 seconds for Raku and around 0.86 seconds for Julia.

I enjoyed writing the Perl 5 script and found it easy and fast to write. Perl is designed to efficiently use flat lists and strings in solving puzzles. I often like looking for solutions that avoid more complicated data structures.

What works well for Perl does not work so well in Julia, though. Probably a different approach is called for in Julia, say using arrays instead of dictionaries.

Comments

Post a Comment

Popular posts from this blog

PWC 215

PWC 215 I have attempted the Perl Weekly Challenge after a hiatus of several weeks, as I was too busy at work. Still busy, so I have just attempted the current challenge in Perl 5. Like I like to do, I have restricted myself to perl 4 syntax as specified in the first edition of Programming perl. Update and disclaimer : These programs will not work on Perl 4 as I discovered later when I found and installed a Perl 4.019 executable. For one thing, the ability to assign a subroutine to a locally scoped typeglob was not available in Perl 4. Challenge 1 (Odd one out) In this challenge, we are given a list of alphabetic strings, and asked to return the list without the strings in which the characters are not sorted (I assume that this means sorted in lexical ascending order). We are also asked to print the number of strings that were removed (i.e., that were not sorted).  I use a subroutine &odd_one_out(@words) with a nested helper sub-sub-routine to check if a string is sorted. Here i
Read more

PWC 227

PWC 227 Challenge 1 (Friday 13th) This challenge requires us to count the number of times Friday 13th occurs in a particular year. I use Date::Manip. This module probably has easier ways to do this using a Date Range, but my approach is easy enough. My &friday_13th subroutine takes the year as input, throws an exception if it is outside the specified range (1753 to 9999), and then cycles through the 13th of each month, counting the Fridays. use Date::Manip; my $dateobj=Date::Manip::Date->new(); sub friday_13th {     my ($year)=@_;     my $retval=0;     ( ($year > 9999) || ($year < 1753) ) &&         die "Year should be between 1753 and 9999";     map {         ( ($dateobj->new_date("$year-$_-13")->printf('%w') ) == 5 ) &&             $retval++;     }     1 .. 12;          $retval; }   Challenge 2 (Roman Maths) This challenge requires us to implement a calculator that parses infix math operations using roman numerals.  There
Read more

PWC 234

PWC 234 I tried to restrict to Perl 4 syntax for both challenges this week, as documented in Rex Swain's Perl 4 reference or the 1st edition of Programming perl. I do use nested subroutines, which I am not sure would actually work in Perl 4, though they comply with the syntax. My programs are tested on Perl 5.38. (The -l in the shebang line works only in Perl 5. The Perl 4 equivalent was -L012 in Unix, which is no longer available.) As I have mentioned before, my aims in using the old syntax are just mild nostalgia plus to add a bit of additional challenge to the task. I know that this is not the most efficient or idiomatic way to do things today. But I should observe that it is really cool that I am able to write code using 30-year old syntax, and run it unmodified on the latest Perl 5.38. You cannot do this with Python 3 for example. This very deep backward compatibility is one of those unsung underappreciated beauties of Perl 5. In my opinion, it is a very cool thing in
Read more