Merge remote-tracking branch 'upstream/master'

23 files changed, 3376 insertions, 2839 deletions

diff --git a/challenge-184/jo-37/perl/ch-1.pl b/challenge-184/jo-37/perl/ch-1.pl
new file mode 100755
index 0000000000..5e34086741
--- /dev/null
+++ b/challenge-184/jo-37/perl/ch-1.pl
@@ -0,0 +1,64 @@
+#!/usr/bin/perl -s
+
+use v5.24;
+use Test2::V0;
+
+our ($tests, $examples);
+
+run_tests() if $tests || $examples;	# does not return
+
+die <<EOS unless @ARGV;
+usage: $0 [-examples] [-tests] [STRING...]
+
+-examples
+    run the examples from the challenge
+ 
+-tests
+    run some tests
+
+STRING
+    list of strings
+
+EOS
+
+
+### Input and Output
+
+say "(@{[sequence_number(@ARGV)]})";
+
+
+### Implementation
+
+# It is not clear how to maintain prefixes that come out of order.  In
+# the examples the prefixes are simply replaced with a two-digit number.
+sub sequence_number {
+	my $seq = 0;
+    map s/^[a-z]{2}(?=\d+$)/sprintf "%02d", $seq++/er, @_;
+}
+
+
+### Examples and tests
+
+sub run_tests {
+    SKIP: {
+        skip "examples" unless $examples;
+
+        is [sequence_number('ab1234', 'cd5678', 'ef1342')],
+            ['001234', '015678', '021342'], 'example 1';
+
+        is [sequence_number('pq1122', 'rs3334')],
+            ['001122', '013334'], 'example 2';
+    }
+
+    SKIP: {
+        skip "tests" unless $tests;
+
+        is [sequence_number('112233')], ['112233'], 'no prefix';
+        is [sequence_number('abc123')], ['abc123'], 'prefix too long';
+        is [sequence_number('ab')], ['ab'], 'no suffix';
+
+	}
+
+    done_testing;
+    exit;
+}
diff --git a/challenge-184/jo-37/perl/ch-2.pl b/challenge-184/jo-37/perl/ch-2.pl
new file mode 100755
index 0000000000..8927c04ab5
--- /dev/null
+++ b/challenge-184/jo-37/perl/ch-2.pl
@@ -0,0 +1,65 @@
+#!/usr/bin/perl -s
+
+use v5.24;
+use Test2::V0;
+use List::MoreUtils qw(part);
+use List::UtilsBy qw(zip_by);
+use Data::Dump;
+
+our ($tests, $examples);
+
+run_tests() if $tests || $examples;	# does not return
+
+die <<EOS unless @ARGV;
+usage: $0 [-examples] [-tests] [STRING...]
+
+-examples
+    run the examples from the challenge
+ 
+-tests
+    run some tests
+
+STRING...
+    list of strings, where each string consists of space-separated
+    digits and letters
+
+EOS
+
+
+### Input and Output
+
+dd split_array(@ARGV);
+
+
+### Implementation
+
+# Split each string into its space separated elements, distribute these
+# onto two buckets of non-digits and digits, collect alike buckets and
+# drop empty ones.
+sub split_array {
+    [map {[grep $_, @$_]}
+        zip_by {[@_]}
+        map {[part {/\D/} @$_]}
+        map [split], @_];
+}
+
+
+### Examples and tests
+
+sub run_tests {
+    SKIP: {
+        skip "examples" unless $examples;
+
+        is split_array('a 1 2 b 0', '3 c 4 d'),
+            [[[1,2,0], [3,4]], [['a','b'], ['c','d']]], 'example 1';
+        is split_array('1 2', 'p q r', 's 3', '4 5 t'),
+            [[[1,2], [3], [4,5]], [['p','q','r'], ['s'], ['t']]], 'example 2';
+    }
+
+    SKIP: {
+        skip "tests" unless $tests;
+	}
+
+    done_testing;
+    exit;
+}
diff --git a/challenge-215/robbie-hatley/blog.txt b/challenge-215/robbie-hatley/blog.txt
new file mode 100644
index 0000000000..f494733cd3
--- /dev/null
+++ b/challenge-215/robbie-hatley/blog.txt
@@ -0,0 +1 @@
+https://hatley-software.blogspot.com/2023/05/robbie-hatleys-solutions-to-weekly_2.html
\ No newline at end of file
diff --git a/challenge-215/robbie-hatley/perl/ch-1.pl b/challenge-215/robbie-hatley/perl/ch-1.pl
new file mode 100755
index 0000000000..8b748387ea
--- /dev/null
+++ b/challenge-215/robbie-hatley/perl/ch-1.pl
@@ -0,0 +1,87 @@
+#! /bin/perl -CSDA
+
+=pod
+
+------------------------------------------------------------------------------------------------------------------------
+COLOPHON:
+This is a 120-character-wide Unicode UTF-8 Perl-source-code text file with hard Unix line breaks ("\x0A").
+¡Hablo Español! Говорю Русский. Björt skjöldur. ॐ नमो भगवते वासुदेवाय. 看的星星，知道你是爱。麦藁雪、富士川町、山梨県。
+
+------------------------------------------------------------------------------------------------------------------------
+TITLE BLOCK:
+ch-1.pl
+Robbie Hatley's Perl solutions for The Weekly Challenge 215-1.
+Written by Robbie Hatley on Tue May 2, 2023.
+
+------------------------------------------------------------------------------------------------------------------------
+Task 1: Odd One Out
+Submitted by: Mohammad S Anwar
+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.
+
+Example 1:  Input: ('abc', 'xyz', 'tsu')  Output: 1
+Example 2:  Input: ('rat', 'cab', 'dad')  Output: 3
+Example 3:  Input: ( 'x',   'y',   'z' )  Output: 0
+
+------------------------------------------------------------------------------------------------------------------------
+PROBLEM NOTES:
+I think the simplest way to find unsorted words is to compare each $word to join(sort(split($word))).
+
+------------------------------------------------------------------------------------------------------------------------
+INPUT / OUTPUT NOTES:
+Input is via either built-in variables or via @ARGV. If using @ARGV, provide one argument which must be a double-quoted
+array of arrays in proper Perl syntax, with each inner array being a sequence of single-quoted words, like so:
+./ch-1.pl "(['Tom', 'Bob', 'Sue'], ['Abe', 'Cor', 'Den'], [ 'and', 'for', 'you' ],)";
+
+Output is to STDOUT and will be each word list followed by the number of unsorted words.
+
+=cut
+
+# ----------------------------------------------------------------------------------------------------------------------
+# PRELIMINARIES:
+use v5.36;
+use strict;
+use warnings;
+use utf8;
+use Sys::Binmode;
+use Time::HiRes 'time';
+$"=', ';
+
+# ----------------------------------------------------------------------------------------------------------------------
+# SUBROUTINES:
+sub is_unsorted ($word) {
+   return fc $word ne fc join '', sort split //, $word;
+}
+
+# ----------------------------------------------------------------------------------------------------------------------
+# DEFAULT INPUTS:
+my @arrays =
+(
+   ['abc', 'xyz', 'tsu'],
+   ['rat', 'cab', 'dad'],
+   [ 'x',   'y',   'z' ],
+);
+
+# ----------------------------------------------------------------------------------------------------------------------
+# NON-DEFAULT INPUTS:
+if (@ARGV) {@arrays = eval($ARGV[0]);}
+
+# ----------------------------------------------------------------------------------------------------------------------
+# MAIN BODY OF PROGRAM:
+{ # begin main
+   my $t0 = time;
+   foreach my $aref (@arrays) {
+      my $unsorted=0;
+      foreach my $word (@$aref) {
+         if (is_unsorted($word)) {
+            ++$unsorted;
+         }
+      }
+      say '';
+      say "word list: (@$aref)";
+      say "unsorted:  $unsorted";
+   }
+   my $µs = 1000000 * (time - $t0);
+   printf("\nExecution time was %.3fµs.\n", $µs);
+   exit 0;
+} # end main
diff --git a/challenge-215/robbie-hatley/perl/ch-2.pl b/challenge-215/robbie-hatley/perl/ch-2.pl
new file mode 100755
index 0000000000..ffbc5ba583
--- /dev/null
+++ b/challenge-215/robbie-hatley/perl/ch-2.pl
@@ -0,0 +1,143 @@
+#! /bin/perl -CSDA
+
+=pod
+
+------------------------------------------------------------------------------------------------------------------------
+COLOPHON:
+This is a 120-character-wide Unicode UTF-8 Perl-source-code text file with hard Unix line breaks ("\x0A").
+¡Hablo Español! Говорю Русский. Björt skjöldur. ॐ नमो भगवते वासुदेवाय. 看的星星，知道你是爱。麦藁雪、富士川町、山梨県。
+
+------------------------------------------------------------------------------------------------------------------------
+TITLE BLOCK:
+ch-2.pl
+Robbie Hatley's Perl solutions for The Weekly Challenge 215-2.
+Written by Robbie Hatley on Tue May 2, 2023.
+
+------------------------------------------------------------------------------------------------------------------------
+Task 2: Number Placement
+Submitted by: Mohammad S Anwar
+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
+can only replace when there is no 1 on either side. Print 1 if it is possible otherwise 0.
+
+Example 1:  Input: @numbers = (1,0,0,0,1),         $count = 1  Output: 1
+Example 2:  Input: @numbers = (1,0,0,0,1),         $count = 2  Output: 0
+Example 3:  Input: @numbers = (1,0,0,0,0,0,0,0,1), $count = 3  Output: 1
+
+------------------------------------------------------------------------------------------------------------------------
+PROBLEM NOTES:
+Conceptually, this is even simpler than Task 1: Just replace what we can, keep tally, and if tally >= $count, print 1,
+else 0. But in-practice, there is the annoying matter of "special cases": Arrays of sizes 0,1,2 and the 0th and last
+elements of every array. Those all need to be handled separately, so it's not just a case of writing a sub and applying
+it to every element of an array using a for loop. In fact, I ended up using NO subs but a disgusting number of "if"
+statements to handle the special cases.
+
+------------------------------------------------------------------------------------------------------------------------
+INPUT / OUTPUT NOTES:
+
+Input is via either built-in variables or via @ARGV. If using @ARGV, provide one argument which must be a single-quoted
+array of arrays in proper Perl syntax, with each inner array being a list of 1s and 0s followed by count. Eg:
+./ch-2.pl '([1,0,1,0,1,1],[1,0,0,0,2],[1,0,0,0,1],[0,1,0,0,0,0,0,0,0,0,1,2])'
+
+Output is to STDOUT and will be list of numbers, count, and number of replacements, on separate lines.
+
+=cut
+
+# ----------------------------------------------------------------------------------------------------------------------
+# PRELIMINARIES:
+use v5.36;
+use strict;
+use warnings;
+use utf8;
+use Sys::Binmode;
+use Time::HiRes 'time';
+$"=', ';
+
+# ----------------------------------------------------------------------------------------------------------------------
+# DEFAULT INPUTS:
+my @arrays =
+(
+   [1,0,0,0,1,1],
+   [1,0,0,0,1,2],
+   [1,0,0,0,0,0,0,0,1,3],
+);
+
+# ----------------------------------------------------------------------------------------------------------------------
+# NON-DEFAULT INPUTS:
+if (@ARGV) {@arrays = eval($ARGV[0]);}
+
+# ----------------------------------------------------------------------------------------------------------------------
+# MAIN BODY OF PROGRAM:
+{ # begin main
+   my $t0 = time;
+   for my $aref (@arrays) {
+      my @numbers = @$aref;                                  # "Original" copy of array.
+      my $count   = pop @numbers;                            # Pop "desired replacement count" off end of @numbers.
+      my @mutable = @numbers;                                # "Working" copy of @numbers; this may get altered.
+      my $yes   = 0;                                         # WAS @mutable altered?
+      my $tally = 0;                                         # If so, how many TIMES was it altered?
+      my $sz    = scalar(@mutable);                          # Size of @mutable.
+
+      # First of all, we need to handle three bloody-annoying "special-case" array sizes: 0, 1, 2:
+
+      if    ( 0 == $sz ) {                                   # If array has 0 elements:
+         ;                                                   # No replacements are possible, so do nothing.
+      }
+
+      elsif ( 1 == $sz ) {                                   # Else if array has 1 element:
+         if ( $mutable[0] == 0 ) {                           # If element is 0,
+            $mutable[0] = 1;                                 # replace 0 with 1
+            ++$tally;                                        # and increment tally.
+         }
+      }
+
+      elsif ( 2 == $sz ) {                                   # Else if array has 2 elements:
+         if ( $mutable[0] == 0                               # If  0th element is 0
+           && $mutable[1] != 1 ) {                           # and 1st element is not 1,
+            $mutable[0] = 1;                                 # replace 0 with 1
+            ++$tally;                                        # and increment tally.
+         }
+         if ( $mutable[1] == 0                               # If  1st element is 0,
+           && $mutable[0] != 1 ) {                           # and 0th element is not 1
+            $mutable[1] = 1;                                 # replace 0 with 1
+            ++$tally;                                        # and increment tally.
+         }
+      }                                                      # at-most-one 0 can be replaced by 1.)
+
+      # Now, finally, we can get on with the code for the vast majority of cases, in which $sz > 2:
+
+      else {                                                 # Else array has 3-or-more elements:
+         if ( $mutable[0] == 0                               # If  0th element is 0,
+           && $mutable[1] != 1) {                            # and 1st element is not 1,
+            $mutable[0] = 1;                                 # replace 0 with 1
+            ++$tally;                                        # and increment tally.
+         }
+         for ( my $i = 1 ; $i <= $#mutable-1 ; ++$i ) {      # For each non-end element,
+            if ( $mutable[$i] == 0                           # if it's 0
+              && $mutable[$i-1] != 1                         # and element to left  is not 1
+              && $mutable[$i+1] != 1 ) {                     # and element to right is not 1
+               $mutable[$i] = 1;                             # replace 0 with 1
+               ++$tally;                                     # and increment tally.
+            }
+         }
+         if ( $mutable[$#mutable] == 0                       # If last element is 0,
+           && $mutable[$#mutable-1] != 1 ) {                 # and penultimate element is not 1,
+            $mutable[$#mutable] = 1;                         # replace 0 with 1
+            ++$tally;                                        # and increment tally.
+         }
+      }
+
+      if ($tally >= $count) {                                # If we were able to make AT-LEAST as many replacements
+         $yes = 1;                                           # as were requested, then set $yes to 1;
+      }                                                      # else leave it set to 0.
+
+      say '';                                                # Print results:
+      say "numbers:    (@numbers)";                          # Original input array.
+      say "quota:      $count";                              # Requested replacement count.
+      say "replaced:   $tally";                              # Tally of actual replacements.
+      say "met quota?: $yes";                                # Output.
+   }
+   my $µs = 1000000 * (time - $t0);                          # Calculate elpased time in µs,
+   printf("\nExecution time was %.3fµs.\n", $µs);            # print elapsed time,
+   exit 0;                                                   # and exit program.
+} # end main
diff --git a/challenge-215/robert-dicicco/perl/ch-2.pl b/challenge-215/robert-dicicco/perl/ch-2.pl
new file mode 100644
index 0000000000..2a247a48c3
--- /dev/null
+++ b/challenge-215/robert-dicicco/perl/ch-2.pl
@@ -0,0 +1,72 @@
+#!/usr/bin/env perl
+=begin pod
+-----------------------------------------
+AUTHOR: Robert DiCicco
+DATE  : 2023-05-02
+Challenge 215 Number Placement ( Perl )
+-----------------------------------------
+=cut
+use strict;
+use warnings;
+use feature 'say';
+use IO::Prompter;
+
+sub CheckZeroes {
+    my $arr = shift;
+    my $cnt = shift;
+    my $zcnt = $cnt * 2;
+    while($zcnt < scalar @$arr - 1) {
+        if ((@$arr[$zcnt] == 0) && (@$arr[$zcnt-1] != 1)) {
+             @$arr[$zcnt] = 1;
+        }
+        $zcnt++;
+    }
+    say "Output: 1 = ",@$arr;
+}
+
+sub HowManyZeroes {
+    my $arr = shift;
+    my $z = 0;
+    my $zcnt = 0;
+    while ($z < scalar @$arr - 1) {
+        if (@$arr[$z] == 0) {
+            $zcnt++;
+        }
+        $z++;
+    }
+    return $zcnt;
+}
+my $testarr = prompt -num, 'Enter an array as a string of numbers ';
+my @numbers = split(//,$testarr);
+chomp(@numbers);
+
+my $count = prompt -num, 'Enter count ';
+
+#say "Input: \@numbers = ",@numbers;
+#say "Count = ",$count;
+my $zeroes = HowManyZeroes(\@numbers);
+if ($zeroes < $count * 2) {
+    say "Output: 0";
+} else {
+    CheckZeroes(\@numbers,$count-1);
+}
+
+=begin pod
+-----------------------------------------
+SAMPLE OUTPUT
+perl .\NumberPlacement.pl
+Enter an array as a string of numbers 10001
+Enter count 1
+Output: 1 = 10101
+
+perl .\NumberPlacement.pl
+Enter an array as a string of numbers 10001
+Enter count 2
+Output: 0
+
+perl .\NumberPlacement.pl
+Enter an array as a string of numbers 101000001
+Enter count 3
+Output: 1 = 101010101
+-----------------------------------------
+=cut
diff --git a/challenge-215/robert-dicicco/raku/ch-2.raku b/challenge-215/robert-dicicco/raku/ch-2.raku
new file mode 100644
index 0000000000..da1a5ce11c
--- /dev/null
+++ b/challenge-215/robert-dicicco/raku/ch-2.raku
@@ -0,0 +1,71 @@
+#!/usr/bin/env raku
+#`{
+-----------------------------------------
+AUTHOR: Robert DiCicco
+DATE  : 2023-05-02
+Challenge 215 Number Placement ( Raku )
+
+When entering, the first digit is the count, the remainder is the array
+For example, the first example would be 1 1 0 0 0 1
+which stands for a count of one, with array 1 0 0 0 1
+-----------------------------------------
+}
+use v6;
+
+sub CheckZeroes(@arr is copy, $cnt) {
+    my $zcnt = $cnt * 2;
+    while $zcnt < @arr.elems - 1 {
+        if ((@arr[$zcnt] == 0) && (@arr[$zcnt-1] != 1)) {
+             @arr[$zcnt] = 1;
+        }
+        $zcnt++;
+    }
+    say "Output: 1 = ",@arr;
+}
+
+sub HowManyZeroes(@arr) {
+    my $z = 0;
+    my $zcnt = 0;
+    while $z < (@arr.elems) - 1 {
+        if (@arr[$z] == 0) {
+            $zcnt++;
+        }
+        $z++;
+    }
+    return $zcnt;
+}
+
+unit sub MAIN ($count where 0 <= $count <= 9, *@numbers where @numbers.elems > 0 && all(@numbers) ~~ UInt);
+say "Input: \@numbers = ", @numbers;
+say "Count = $count";
+
+my $test = HowManyZeroes(@numbers);
+
+my $zeroes = HowManyZeroes(@numbers);
+
+if ($zeroes < $count * 2) {
+    say "Output: 0";
+} else {
+    CheckZeroes(@numbers,$count-1);
+}
+
+
+#`{
+-----------------------------------------
+SAMPLE OUTPUT
+raku .\NumberPlacement.rk 1 1 0 0 0 1
+Input: @numbers = [1 0 0 0 1]
+Count = 1
+Output: 1 = [1 0 1 0 1]
+
+PS G:\Projects\Perl\Challenges> raku .\NumberPlacement.rk 2 1 0 0 0 1
+Input: @numbers = [1 0 0 0 1]
+Count = 2
+Output: 0
+
+PS G:\Projects\Perl\Challenges> raku .\NumberPlacement.rk 3 1 0 1 0 0 0 0 0 1
+Input: @numbers = [1 0 1 0 0 0 0 0 1]
+Count = 3
+Output: 1 = [1 0 1 0 1 0 1 0 1]
+-----------------------------------------
+}
diff --git a/stats/pwc-challenge-184.json b/stats/pwc-challenge-184.json
index 88f279c25f..6accbd31a6 100644
--- a/stats/pwc-challenge-184.json
+++ b/stats/pwc-challenge-184.json
@@ -1,63 +1,52 @@
 {
-   "tooltip" : {
-      "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>",
-      "followPointer" : 1,
-      "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>"
-   },
-   "legend" : {
-      "enabled" : 0
-   },
-   "subtitle" : {
-      "text" : "[Champions: 37] Last updated at 2023-04-03 00:46:09 GMT"
-   },
    "xAxis" : {
       "type" : "category"
    },
-   "chart" : {
-      "type" : "column"
+   "legend" : {
+      "enabled" : 0
    },
    "series" : [
       {
          "data" : [
             {
                "drilldown" : "Arne Sommer",
-               "name" : "Arne Sommer",
-               "y" : 5
+               "y" : 5,
+               "name" : "Arne Sommer"
             },
             {
                "drilldown" : "Athanasius",
-               "name" : "Athanasius",
-               "y" : 4
+               "y" : 4,
+               "name" : "Athanasius"
             },
             {
-               "y" : 2,
                "name" : "Bob Lied",
-               "drilldown" : "Bob Lied"
+               "drilldown" : "Bob Lied",
+               "y" : 2
             },
             {
-               "name" : "Branislav Zahradnik",
+               "y" : 2,
                "drilldown" : "Branislav Zahradnik",
-               "y" : 2
+               "name" : "Branislav Zahradnik"
             },
             {
+               "drilldown" : "Bruce Gray",
                "y" : 2,
-               "name" : "Bruce Gray",
-               "drilldown" : "Bruce Gray"
+               "name" : "Bruce Gray"
             },
             {
+               "name" : "Cheok-Yin Fung",
                "y" : 2,
-               "drilldown" : "Cheok-Yin Fung",
-               "name" : "Cheok-Yin Fung"
+               "drilldown" : "Cheok-Yin Fung"
             },
             {
                "drilldown" : "Colin Crain",
-               "name" : "Colin Crain",
-               "y" : 3
+               "y" : 3,
+               "name" : "Colin Crain"
             },
             {
-               "y" : 2,
                "name" : "Dario Mazzeo",
-               "drilldown" : "Dario Mazzeo"
+               "drilldown" : "Dario Mazzeo",
+               "y" : 2
             },
             {
                "y" : 2,
@@ -65,19 +54,19 @@
                "name" : "Dave Cross"
             },
             {
+               "drilldown" : "Duncan C. White",
                "y" : 2,
-               "name" : "Duncan C. White",
-               "drilldown" : "Duncan C. White"
+               "name" : "Duncan C. White"
             },
             {
+               "y" : 2,
                "drilldown" : "E. Choroba",
-               "name" : "E. Choroba",
-               "y" : 2
+               "name" : "E. Choroba"
             },
             {
+               "name" : "Flavio Poletti",
                "y" : 6,
-               "drilldown" : "Flavio Poletti",
-               "name" : "Flavio Poletti"
+               "drilldown" : "Flavio Poletti"
             },
             {
                "name" : "Humberto Massa",
@@ -85,109 +74,114 @@
                "y" : 2
             },
             {
-               "y" : 5,
+               "name" : "Jaldhar H. Vyas",
                "drilldown" : "Jaldhar H. Vyas",
-               "name" : "Jaldhar H. Vyas"
+               "y" : 5
             },
             {
-               "y" : 2,
                "name" : "James Raspass",
-               "drilldown" : "James Raspass"
+               "drilldown" : "James Raspass",
+               "y" : 2
             },
             {
-               "drilldown" : "James Smith",
                "name" : "James Smith",
+               "drilldown" : "James Smith",
                "y" : 3
             },
             {
-               "y" : 2,
+               "name" : "Jan Krnavek",
                "drilldown" : "Jan Krnavek",
-               "name" : "Jan Krnavek"
+               "y" : 2
+            },
+            {
+               "drilldown" : "Jorg Sommrey",
+               "y" : 2,
+               "name" : "Jorg Sommrey"
             },
             {
+               "name" : "Julien Fiegehenn",
                "y" : 2,
-               "drilldown" : "Julien Fiegehenn",
-               "name" : "Julien Fiegehenn"
+               "drilldown" : "Julien Fiegehenn"
             },
             {
-               "drilldown" : "Kjetil Skotheim",
                "name" : "Kjetil Skotheim",
-               "y" : 2
+               "y" : 2,
+               "drilldown" : "Kjetil Skotheim"
             },
             {
+               "name" : "Kueppo Wesley",
                "y" : 2,
-               "drilldown" : "Kueppo Wesley",
-               "name" : "Kueppo Wesley"
+               "drilldown" : "Kueppo Wesley"
             },
             {
-               "y" : 5,
                "name" : "Laurent Rosenfeld",
+               "y" : 5,
                "drilldown" : "Laurent Rosenfeld"
             },
             {
-               "drilldown" : "Lubos Kolouch",
                "name" : "Lubos Kolouch",
-               "y" : 2
+               "y" : 2,
+               "drilldown" : "Lubos Kolouch"
             },
             {
                "drilldown" : "Luca Ferrari",
-               "name" : "Luca Ferrari",
-               "y" : 8
+               "y" : 8,
+               "name" : "Luca Ferrari"
             },
             {
                "y" : 2,
-               "name" : "Mark Anderson",
-               "drilldown" : "Mark Anderson"
+               "drilldown" : "Mark Anderson",
+               "name" : "Mark Anderson"
             },
             {
                "name" : "Marton Polgar",
-               "drilldown" : "Marton Polgar",
-               "y" : 2
+               "y" : 2,
+               "drilldown" : "Marton Polgar"
             },
             {
-               "drilldown" : "Matthew Neleigh",
                "name" : "Matthew Neleigh",
-               "y" : 2
+               "y" : 2,
+               "drilldown" : "Matthew Neleigh"
             },
             {
-               "y" : 2,
                "drilldown" : "Mohammad S Anwar",
+               "y" : 2,
                "name" : "Mohammad S Anwar"
             },
             {
-               "y" : 2,
                "drilldown" : "Niels van Dijke",
+               "y" : 2,
                "name" : "Niels van Dijke"
             },
             {
+               "name" : "Paulo Custodio",
                "y" : 2,
-               "drilldown" : "Paulo Custodio",
-               "name" : "Paulo Custodio"
+               "drilldown" : "Paulo Custodio"
             },
             {
                "name" : "Peter Campbell Smith",
-               "drilldown" : "Peter Campbell Smith",
-               "y" : 3
+               "y" : 3,
+               "drilldown" : "Peter Campbell Smith"
             },
             {
-               "drilldown" : "Robert DiCicco",
                "name" : "Robert DiCicco",
-               "y" : 2
+               "y" : 2,
+               "drilldown" : "Robert DiCicco"
             },
             {
+               "drilldown" : "Robert Ransbottom",
                "y" : 2,
-               "name" : "Robert Ransbottom",
-               "drilldown" : "Robert Ransbottom"
+               "name" : "Robert Ransbottom"
             },
             {
-               "drilldown" : "Roger Bell_West",
                "name" : "Roger Bell_West",
-               "y" : 5
+               "y" : 5,
+               "drilldown" : "Roger Bell_West"
             },
             {
+               "name" : "Solathian",
                "y" : 2,
-               "drilldown" : "Solathian",
-               "name" : "Solathian"
+               "drilldown" : "Solathian"
             },
             {
                "name" : "Stephen G. Lynn",
@@ -200,34 +194,33 @@
                "name" : "Ulrich Rieke"
             },
             {
-               "y" : 3,
                "name" : "W. Luis Mochan",
-               "drilldown" : "W. Luis Mochan"
+               "drilldown" : "W. Luis Mochan",
+               "y" : 3
             }
          ],
-         "name" : "The Weekly Challenge - 184",
-         "colorByPoint" : 1
+         "colorByPoint" : 1,
+         "name" : "The Weekly Challenge - 184"
       }
    ],
+   "chart" : {
+      "type" : "column"
+   },
    "yAxis" : {
       "title" : {
          "text" : "Total Solutions"
       }
    },
-   "plotOptions" : {
-      "series" : {
-         "borderWidth" : 0,
-         "dataLabels" : {
-            "format" : "{point.y}",
-            "enabled" : 1
-         }
-      }
+   "title" : {
+      "text" : "The Weekly Challenge - 184"
+   },
+   "subtitle" : {
+      "text" : "[Champions: 38] Last updated at 2023-05-02 22:12:39 GMT"
    },
    "drilldown" : {
       "series" : [
          {
             "name" : "Arne Sommer",
-            "id" : "Arne Sommer",
             "data" : [
                [
                   "Perl",
@@ -241,9 +234,11 @@
                   "Blog",