Robbie Hatley's Perl Solutions To The Weekly Challenge #213

For those not familiar with "The Weekly Challenge", it is a weekly programming puzzle, usually with two parts, cycling every Sunday. You can find it here:

The Weekly Challenge

This week (2023-04-16 through 2023-04-22) is weekly challenge #213.

Task 1 is as follows:

"Write a script to sort a list of positive integers so that the sorted list consists of the even integers in ascending order followed by the odd integers in ascending order."

I found this super-simple:

Robbie Hatley's Perl Solution to The Weekly Challenge 213-1

Task 2 is as follows:

You are given a list of bidirectional routes defining a network of nodes, as well as source and destination node numbers. Write a script to find the route from source to destination that passes through fewest nodes.

That one, I didn't have time to complete, but here's a stub, as far as I got with it:

Robbie Hatley's Perl Solution to The Weekly Challenge 212-2

That's it for 213; see you on 214!

Comments

Post a Comment

Popular posts from this blog

Robbie Hatley's Solutions To The Weekly Challenge #215

For those not familiar with "The Weekly Challenge", it is a weekly programming puzzle, usually with two parts, cycling every Sunday. You can find it here: The Weekly Challenge This week (2023-04-30 through 2023-05-06) is weekly challenge #215. Task 1 is as follows: "You are given a list of words (alphabetic characters only) of same size. Write a script to remove all words not sorted alphabetically and print the number of words in the list that are not alphabetically sorted." I found the solution easy, just a matter of determining which words are "sorted" by comparing each $word to join(sort(split($word))), like so: Robbie Hatley's Perl Solution to The Weekly Challenge 215-1 Task 2 is as follows: "You are given a list of numbers having just 0 and 1. You are also given placement count (>=1). Write a script to find out if it is possible to replace 0 with 1 the given number of times in the given list. The only condition is that you
Read more

Robbie Hatley's Solutions To The Weekly Challenge #221

For those not familiar with "The Weekly Challenge", it is a weekly programming puzzle, usually with two parts, cycling every Sunday. You can find it here: The Weekly Challenge This week (2023-06-11 through 2023-06-17) is weekly challenge #221. Task 1 is as follows: "You are given a list of strings "@words" and a string "$chars". A string is "good" if it contains only characters from "$chars", with each character used once-only per string. Write a script to return the sum of lengths of all elements of "@words" which are "good"." Example 1: Input: @strings = ("cat", "bt", "hat", "tree"), $chars = "atach" Output: 6 (The good strings that can be formed are "cat" and "hat", so the answer is 3 + 3 = 6.) Example 2: Input: @strings = ("hello", "world", "challenge"); $chars = "welldonehopper"; Out
Read more

Robbie Hatley's Solutions To The Weekly Challenge #239

For those not familiar with "The Weekly Challenge", it is a weekly programming puzzle with two parts, cycling every Sunday. You can find it here: The Weekly Challenge This week (2023-10-15 through 2023-10-21) is weekly challenge #239. Task 239-1 is as follows: Task 1: Same String Submitted by: Mohammad S Anwar Given two arrays of strings, write a script to find out if the word created by concatenating the array elements is the same. Example 1: Input: @arr1 = ("ab", "c") @arr2 = ("a", "bc") Output: true Using @arr1, word1 => "ab" . "c" => "abc" Using @arr2, word2 => "a" . "bc" => "abc" Example 2: Input: @arr1 = ("ab", "c") @arr2 = ("ac", "b") Output: false Using @arr1, word1 => "ab" . "c" => "abc" Using @arr2, word2 => "ac" . "b" => "acb&
Read more