diff options
| author | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2021-06-06 23:59:57 +0100 |
|---|---|---|
| committer | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2021-06-06 23:59:57 +0100 |
| commit | 040636ba800110c76d302f6e9af3a39abceb444f (patch) | |
| tree | 2b0e65e1da8efffc3296924e42ef1234f21aedd2 | |
| parent | 4827c4bca8deaa98df21f4a61ac2f3d92196dd8a (diff) | |
| download | perlweeklychallenge-club-040636ba800110c76d302f6e9af3a39abceb444f.tar.gz perlweeklychallenge-club-040636ba800110c76d302f6e9af3a39abceb444f.tar.bz2 perlweeklychallenge-club-040636ba800110c76d302f6e9af3a39abceb444f.zip | |
- Added solutions by Colin Crain.
| -rw-r--r-- | challenge-115/colin-crain/perl/ch-1.pl | 123 | ||||
| -rw-r--r-- | challenge-115/colin-crain/perl/ch-2.pl | 72 | ||||
| -rw-r--r-- | challenge-115/colin-crain/raku/ch-1.raku | 67 | ||||
| -rw-r--r-- | challenge-115/colin-crain/raku/ch-2.raku | 52 | ||||
| -rw-r--r-- | stats/pwc-current.json | 228 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown-summary.json | 56 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown.json | 1678 | ||||
| -rw-r--r-- | stats/pwc-leaders.json | 352 | ||||
| -rw-r--r-- | stats/pwc-summary-1-30.json | 118 | ||||
| -rw-r--r-- | stats/pwc-summary-121-150.json | 104 | ||||
| -rw-r--r-- | stats/pwc-summary-151-180.json | 52 | ||||
| -rw-r--r-- | stats/pwc-summary-181-210.json | 38 | ||||
| -rw-r--r-- | stats/pwc-summary-211-240.json | 80 | ||||
| -rw-r--r-- | stats/pwc-summary-31-60.json | 26 | ||||
| -rw-r--r-- | stats/pwc-summary-61-90.json | 36 | ||||
| -rw-r--r-- | stats/pwc-summary-91-120.json | 36 | ||||
| -rw-r--r-- | stats/pwc-summary.json | 502 |
17 files changed, 1971 insertions, 1649 deletions
diff --git a/challenge-115/colin-crain/perl/ch-1.pl b/challenge-115/colin-crain/perl/ch-1.pl new file mode 100644 index 0000000000..8705c88272 --- /dev/null +++ b/challenge-115/colin-crain/perl/ch-1.pl @@ -0,0 +1,123 @@ +#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# string_cheese.pl
+#
+# String Chain
+# Submitted by: Mohammad S Anwar
+# You are given an array of strings.
+#
+# Write a script to find out if the given strings can be chained to form
+# a circle. Print 1 if found otherwise 0.
+#
+# A string $S can be put before another string $T in circle if the last
+# character of $S is same as first character of $T.
+#
+# Examples:
+# Input: @S = ("abc", "dea", "cd")
+# Output: 1 as we can form circle e.g. "abc", "cd", "dea".
+#
+# Input: @S = ("ade", "cbd", "fgh")
+# Output: 0 as we can't form circle.
+#
+# METHOD:
+# this is more complex than it seems, because there seems to be no
+# limit on the strings or their letters. Multiple strings can start or
+# end with the same letter, giving multiple pathway options that will
+# all need to be explored.
+#
+# Although not expressly stated, I'm going to assume *every* string
+# will need to be connected in this chain for now. Maybe it makes
+# sense to make this configurable.
+#
+# One aspect that works in our favor is the circle: we only care if
+# all the strings can be chained, so consequently the circle is
+# equivalent at all points. This means we can start looking for the
+# chain at any point.
+#
+# therefore we'll start at the first string, and grep the array to
+# find all strings the start with the same letter. For each of these
+# strings we will try adding it to a partial chain and removing it
+# from the list of remaining possibilites. The partial chain and
+# remaining possibilites are then passed along recursively to repeat
+# the step.
+#
+# The exit case is when there are no more valid possibilities to
+# link to. When that happens, if the total list is still has strings
+# init the chain has failed. If we've linked the last sring and that
+# string can link to our first element then we have discovered the
+# chain.
+#
+# Strings can be of any length. In a single letter string the first character
+# is the same as the last.
+#
+# Strings can contain any character. As long as they match they'll chain.
+#
+# There's no reason to exclude multiple instances of the same
+# string. This makes removing used instances from the running a
+# little more tricky than a simple `grep` but it's not too bad. We
+# could avoid using `first` by rolling our own iterator but
+# List::Util is core so why not. List::MoreUtils has `firstidx`,
+# which does exactly what we want, but its not core.
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+use List::Util qw( first );
+
+my @str = @ARGV;
+
+if (scalar @str) {
+ my $res = chain(\@str);
+ say $res? $res : "no chain";
+}
+
+sub chain ($strings, $chain = []) {
+ $chain->[0] = shift $strings->@* if not defined $chain->[0];
+
+ ## base: if no more in pool check last loop link
+ if (scalar $strings->@* == 0) {
+ return join ' ', $chain->@*
+ if substr($chain->[-1], -1) eq substr($chain->[0], 0, 1);
+ return undef;
+ }
+
+ my @next = grep { substr($chain->[-1], -1) eq substr($_, 0, 1) } $strings->@*;
+
+ ## base: no next link and still more in pool fails
+ return undef if @next == 0 and $strings->@* > 0;
+
+ for my $link (@next) {
+ my @possible = $strings->@*;
+ my $idx = first { $possible[$_] eq $link } (0..$#possible);
+ splice @possible, $idx, 1;
+
+ my $result = chain( \@possible, [ $chain->@*, $link ] );
+
+ return $result if defined $result;
+ }
+ return undef;
+}
+
+
+
+
+
+
+
+
+use Test::More;
+
+is chain(["abc", "dea", "cd" ]), "abc cd dea", 'ex-1';
+is chain(["ade", "cbd", "fgh"]), undef, 'ex-2';
+is chain(["abc", "dea", "cda"]), undef, 'short loop';
+is chain(["abc", "aea", "cda"]), "abc cda aea", 'multi first';
+is chain(["abc", "abc", "cda", "cda"]), "abc cda abc cda", 'repeats';
+
+done_testing();
diff --git a/challenge-115/colin-crain/perl/ch-2.pl b/challenge-115/colin-crain/perl/ch-2.pl new file mode 100644 index 0000000000..969b64462e --- /dev/null +++ b/challenge-115/colin-crain/perl/ch-2.pl @@ -0,0 +1,72 @@ +#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# list-one-perl-two.pl
+#
+# Largest Multiple
+# Submitted by: Mohammad S Anwar
+# You are given a list of positive integers (0-9), single digit.
+#
+# Write a script to find the largest multiple of 2
+# that can be formed from the list.
+#
+# Examples
+# Input: @N = (1, 0, 2, 6)
+# Output: 6210
+#
+# Input: @N = (1, 4, 2, 8)
+# Output: 8412
+#
+# Input: @N = (4, 1, 7, 6)
+# Output: 7614
+#
+# method:
+# sort the list
+# iterate from small end:
+# element %% 2 ? splice and small end move to end, last
+# : next
+# join list
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+
+my @arr = @ARGV;
+scalar @arr == 0 and @arr = ( 1, 0, 2, 6);
+
+say largest_two(\@arr);
+
+
+sub largest_two ($arr, $i = 0) {
+ @arr = sort {$a-$b} @$arr;
+ for (@arr) {
+ if ($arr[$i] % 2 == 0) {
+ unshift @arr, splice @arr, $i, 1;
+ last;
+ }
+ $i++;
+ }
+
+ return $i < @arr ? join '', reverse @arr
+ : "none" ;
+}
+
+
+
+use Test::More;
+
+is largest_two( [1, 0, 2, 6] ), 6210, 'ex-1';
+is largest_two( [1, 4, 2, 8] ), 8412, 'ex-2';
+is largest_two( [4, 1, 7, 6] ), 7614, 'ex-3';
+is largest_two( [3, 1, 3, 3] ), "none", 'no multiple';
+is largest_two( [3, 1, 7, 3, 5, 1, 8] ), 7533118, 'work for it';
+
+
+done_testing();
diff --git a/challenge-115/colin-crain/raku/ch-1.raku b/challenge-115/colin-crain/raku/ch-1.raku new file mode 100644 index 0000000000..351f3ceaec --- /dev/null +++ b/challenge-115/colin-crain/raku/ch-1.raku @@ -0,0 +1,67 @@ +#!/usr/bin/env perl6 +# +# +# 115-1-string_cheese.raku +# +# String Chain +# Submitted by: Mohammad S Anwar +# You are given an array of strings. +# +# Write a script to find out if the given strings can be chained to form +# a circle. Print 1 if found otherwise 0. +# +# A string $S can be put before another string $T in circle if the last +# character of $S is same as first character of $T. +# +# Examples: +# Input: @S = ("abc", "dea", "cd") +# Output: 1 as we can form circle e.g. "abc", "cd", "dea". +# +# Input: @S = ("ade", "cbd", "fgh") +# Output: 0 as we can't form circle. +# +# +# © 2021 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + + + +unit sub MAIN () ; + +use Test; + +plan 5; + +is chain(["abc", "dea", "cd" ]), "abc cd dea", 'ex-1'; +is chain(["ade", "cbd", "fgh"]), Nil, 'ex-2'; +is chain(["abc", "dea", "cda"]), Nil, 'short loop'; +is chain(["abc", "aea", "cda"]), "abc cda aea", 'multi first'; +is chain(["abc", "abc", "cda", "cda"]), "abc cda abc cda", 'repeats'; + + + + + +sub chain (@str, *@chain) { + @chain.unshift(@str.shift) unless @chain.elems; + + ## base case: if no more in pool check last loop link + if @str == 0 { + return @chain[*-1].substr(*-1) eq @chain[0].substr(0,1) + ?? @chain.join(' ') + !! Nil; + } + + my @next = @str.grep({@chain[*-1].substr(*-1,1) eq $_.substr(0,1)}) ; + + ## base case: no next link and still more in pool fails + return Nil if @next ~~ Empty and @str.elems; + + for @next -> $link { + my @possible = @str; + splice @possible, @possible.first(* eq $link, :k), 1; + my $result = chain( @possible, |@chain, $link ); + return $result if $result.defined; + } + return Nil; +} diff --git a/challenge-115/colin-crain/raku/ch-2.raku b/challenge-115/colin-crain/raku/ch-2.raku new file mode 100644 index 0000000000..07288559d9 --- /dev/null +++ b/challenge-115/colin-crain/raku/ch-2.raku @@ -0,0 +1,52 @@ +#!/usr/bin/env perl6 +# +# +# 115-2-list-one-perl-two.raku +# +# +# Largest Multiple +# Submitted by: Mohammad S Anwar +# You are given a list of positive integers (0-9), single digit. +# +# Write a script to find the largest multiple of 2 that +# can be formed from the list. +# +# Examples +# Input: @N = (1, 0, 2, 6) +# Output: 6210 +# +# Input: @N = (1, 4, 2, 8) +# Output: 8412 +# +# Input: @N = (4, 1, 7, 6) +# Output: 7614 +# +# method: +# sort the list +# iterate from small end: +# element %% 2 ? splice and small end move to end, last +# : next +# join list +# +# +# © 2021 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + +# @*ARGS = "1", "2", "3"; + +subset ArrayWith2 of Array where {.any ~~ $_.Int %% 2} ; + +multi sub MAIN (ArrayWith2 *@list) { + @list = @list.sort; + say @list.unshift( @list.splice(@list.first(* %% 2, :k), 1) ) + .join + .flip; +} + +multi sub MAIN (@list) { + say "none" +} + + + + diff --git a/stats/pwc-current.json b/stats/pwc-current.json index 978047c686..c2eefbd53a 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -2,15 +2,10 @@ "title" : { "text" : "Perl Weekly Challenge - 115" }, - "subtitle" : { - "text" : "[Champions: 28] Last updated at 2021-06-06 22:40:19 GMT" - }, - "chart" : { - "type" : "column" - }, "drilldown" : { "series" : [ { + "id" : "Abigail", "data" : [ [ "Perl", @@ -21,11 +16,9 @@ 2 ] ], - "id" : "Abigail", "name" : "Abigail" }, { - "id" : "Adam Russell", "name" : "Adam Russell", "data" : [ [ @@ -36,9 +29,11 @@ "Blog", 1 ] - ] + ], + "id" : "Adam Russell" }, { + "id" : "Andinus", "data" : [ [ "Raku", @@ -49,12 +44,11 @@ 1 ] ], - "id" : "Andinus", "name" : "Andinus" }, { - "name" : "Arne Sommer", "id" : "Arne Sommer", + "name" : "Arne Sommer", "data" : [ [ "Perl", @@ -71,8 +65,8 @@ ] }, { - "name" : "Athanasius", "id" : "Athanasius", + "name" : "Athanasius", "data" : [ [ "Perl", @@ -85,8 +79,6 @@ ] }, { - "name" : "Bartosz Jarzyna", - "id" : "Bartosz Jarzyna", "data" : [ [ "Perl", @@ -96,9 +88,12 @@ "Blog", 1 ] - ] + ], + "name" : "Bartosz Jarzyna", + "id" : "Bartosz Jarzyna" }, { + "name" : "Cheok-Yin Fung", "data" : [ [ "Perl", @@ -109,12 +104,19 @@ 1 ] ], - "id" : "Cheok-Yin Fung", - "name" : "Cheok-Yin Fung" + "id" : "Cheok-Yin Fung" }, { "data" : [ [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ], + [ "Blog", 1 ] @@ -123,18 +125,16 @@ "id" : "Colin Crain" }, { - "name" : "Dave Cross", - "id" : "Dave Cross", "data" : [ [ "Perl", 2 ] - ] + ], + "name" : "Dave Cross", + "id" : "Dave Cross" }, { - "name" : "Dave Jacoby", - "id" : "Dave Jacoby", "data" : [ [ "Perl", @@ -144,41 +144,41 @@ "Blog", 1 ] - ] + ], + "name" : "Dave Jacoby", + "id" : "Dave Jacoby" }, { + "name" : "Duncan C. White", "data" : [ [ "Perl", 2 ] ], - "name" : "Duncan C. White", "id" : "Duncan C. White" }, { - "name" : "E. Choroba", - "id" : "E. Choroba", "data" : [ [ "Perl", 2 ] - ] + ], + "name" : "E. Choroba", + "id" : "E. Choroba" }, { - "name" : "Feng Chang", "id" : "Feng Chang", "data" : [ [ "Raku", 2 ] - ] + ], + "name" : "Feng Chang" }, { - "name" : "Flavio Poletti", - "id" : "Flavio Poletti", "data" : [ [ "Perl", @@ -192,9 +192,12 @@ "Blog", 2 ] - ] + ], + "name" : "Flavio Poletti", + "id" : "Flavio Poletti" }, { + "id" : "James Smith", "data" : [ [ "Perl", @@ -205,41 +208,39 @@ 1 ] ], - "id" : "James Smith", "name" : "James Smith" }, { + "id" : "Jan Krnavek", + "name" : "Jan Krnavek", "data" : [ [ "Raku", 2 ] - ], - "id" : "Jan Krnavek", - "name" : "Jan Krnavek" + ] }, { - "id" : "Joan Mimosinnet", - "name" : "Joan Mimosinnet", "data" : [ [ "Raku", 2 ] - ] + ], + "name" : "Joan Mimosinnet", + "id" : "Joan Mimosinnet" }, { "name" : "Jorg Sommrey", - "id" : "Jorg Sommrey", "data" : [ [ "Perl", 2 ] - ] + ], + "id" : "Jorg Sommrey" }, { - "id" : "Laurent Rosenfeld", "name" : "Laurent Rosenfeld", "data" : [ [ @@ -254,11 +255,10 @@ "Blog", 1 ] - ] + ], + "id" : "Laurent Rosenfeld" }, { - "id" : "Luca Ferrari", - "name" : "Luca Ferrari", "data" : [ [ "Raku", @@ -268,41 +268,43 @@ "Blog", 2 ] - ] + ], + "name" : "Luca Ferrari", + "id" : "Luca Ferrari" }, { + "id" : "Mark Anderson", "data" : [ [ "Raku", 1 ] ], - "id" : "Mark Anderson", "name" : "Mark Anderson" }, { + "id" : "Niels van Dijke", "data" : [ [ "Perl", 2 ] ], - "name" : "Niels van Dijke", - "id" : "Niels van Dijke" + "name" : "Niels van Dijke" }, { + "id" : "Pete Houston", + "name" : "Pete Houston", "data" : [ [ "Perl", 2 ] - ], - "name" : "Pete Houston", - "id" : "Pete Houston" + ] }, { - "name" : "Roger Bell_West", "id" : "Roger Bell_West", + "name" : "Roger Bell_West", "data" : [ [ "Perl", @@ -329,8 +331,8 @@ 1 ] ], - "id" : "Simon Green", - "name" : "Simon Green" + "name" : "Simon Green", + "id" : "Simon Green" }, { "id" : "Stuart Little", @@ -347,6 +349,7 @@ ] }, { + "name" : "Ulrich Rieke", "data" : [ [ "Perl", @@ -357,11 +360,9 @@ 2 ] ], - "id" : "Ulrich Rieke", - "name" : "Ulrich Rieke" + "id" : "Ulrich Rieke" }, { - "id" : "W. Luis Mochan", "name" : "W. Luis Mochan", "data" : [ [ @@ -372,10 +373,19 @@ "Blog", 1 ] - ] + ], + "id" : "W. Luis Mochan" } ] }, + "xAxis" : { + "type" : "category" + }, + "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/>" + }, "plotOptions" : { "series" : { "borderWidth" : 0, @@ -385,28 +395,29 @@ } } }, - "tooltip" : { - "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>", - "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>", - "followPointer" : 1 + "legend" : { + "enabled" : 0 + }, + "chart" : { + "type" : "column" + }, + "subtitle" : { + "text" : "[Champions: 28] Last updated at 2021-06-06 22:59:06 GMT" }, "yAxis" : { "title" : { "text" : "Total Solutions" } }, - "xAxis" : { - "type" : "category" - }, "series" : [ { - "name" : "Perl Weekly Challenge - 115", "colorByPoint" : 1, + "name" : "Perl Weekly Challenge - 115", "data" : [ { - "name" : "Abigail", + "y" : 4, "drilldown" : "Abigail", - "y" : 4 + "name" : "Abigail" }, { "name" : "Adam Russell", @@ -414,18 +425,18 @@ "y" : 3 }, { - "drilldown" : "Andinus", "y" : 2, + "drilldown" : "Andinus", "name" : "Andinus" }, { - "drilldown" : "Arne Sommer", "y" : 5, + "drilldown" : "Arne Sommer", "name" : "Arne Sommer" }, { - "drilldown" : "Athanasius", "y" : 2, + "drilldown" : "Athanasius", "name" : "Athanasius" }, { @@ -434,79 +445,79 @@ "name" : "Bartosz Jarzyna" }, { - "drilldown" : "Cheok-Yin Fung", + "name" : "Cheok-Yin Fung", "y" : 3, - "name" : "Cheok-Yin Fung" + "drilldown" : "Cheok-Yin Fung" }, { "name" : "Colin Crain", "drilldown" : "Colin Crain", - "y" : 1 + "y" : 5 }, { + "name" : "Dave Cross", "drilldown" : "Dave Cross", - "y" : 2, - "name" : "Dave Cross" + "y" : 2 }, { - "drilldown" : "Dave Jacoby", "name" : "Dave Jacoby", + "drilldown" : "Dave Jacoby", "y" : 3 }, { - "y" : 2, "drilldown" : "Duncan C. White", + "y" : 2, "name" : "Duncan C. White" }, { + "name" : "E. Choroba", "drilldown" : "E. Choroba", - "y" : 2, - "name" : "E. Choroba" + "y" : 2 }, { - "y" : 2, "drilldown" : "Feng Chang", + "y" : 2, "name" : "Feng Chang" }, { - "drilldown" : "Flavio Poletti", "name" : "Flavio Poletti", - "y" : 6 + "y" : 6, + "drilldown" : "Flavio Poletti" }, { - "drilldown" : "James Smith", "name" : "James Smith", + "drilldown" : "James Smith", "y" : 3 }, { "drilldown" : "Jan Krnavek", - "name" : "Jan Krnavek", - "y" : 2 + "y" : 2, + "name" : "Jan Krnavek" }, { "drilldown" : "Joan Mimosinnet", - "name" : "Joan Mimosinnet", - "y" : 2 + "y" : 2, + "name" : "Joan Mimosinnet" }, { - "drilldown" : "Jorg Sommrey", "y" : 2, + "drilldown" : "Jorg Sommrey", "name" : "Jorg Sommrey" }, { - "name" : "Laurent Rosenfeld", "drilldown" : "Laurent Rosenfeld", - "y" : 5 + "y" : 5, + "name" : "Laurent Rosenfeld" }, { + "name" : "Luca Ferrari", "drilldown" : "Luca Ferrari", - "y" : 4, - "name" : "Luca Ferrari" + "y" : 4 }, { "name" : "Mark Anderson", - "drilldown" : "Mark Anderson", - "y" : 1 + "y" : 1, + "drilldown" : "Mark Anderson" }, { "y" : 2, @@ -514,39 +525,36 @@ "name" : "Niels van Dijke" }, { - "y" : 2, "drilldown" : "Pete Houston", + "y" : 2, "name" : "Pete Houston" }, { - "drilldown" : "Roger Bell_West", + "name" : "Roger Bell_West", "y" : 5, - "name" : "Roger Bell_West" + "drilldown" : "Roger Bell_West" }, { + "y" : 3, "drilldown" : "Simon Green", - "name" : "Simon Green", - "y" : 3 + "name" : "Simon Green" }, { - "drilldown" : "Stuart Little", "name" : "Stuart Little", - "y" : 4 + "y" : 4, + "drilldown" : "Stuart Little" }, { "drilldown" : "Ulrich Rieke", - "name" : "Ulrich Rieke", - "y" : 4 + "y" : 4, + "name" : "Ulrich Rieke" }, { - "drilldown" : "W. Luis Mochan", "y" : 3, + "drilldown" : "W. Luis Mochan", "name" : "W. Luis Mochan" } ] } - ], - "legend" : { - "enabled" : 0 - } + ] } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index 14c222cd64..63f68ecf4e 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -2,21 +2,26 @@ "legend" : { "enabled" : "false" }, + "chart" : { + "type" : "column" + }, + "subtitle" : { + "text" : "Last updated at 2021-06-06 22:59:06 GMT" + }, "series" : [ { "dataLabels" : { - "rotation" : -90, - "color" : "#FFFFFF", - "align" : "right", + "format" : "{point.y:.0f}", "style" : { - "fontSize" : "13px", - "fontFamily" : "Verdana, sans-serif" + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" }, - "format" : "{point.y:.0f}", + "align" : "right", + "color" : "#FFFFFF", "enabled" : "true", - "y" : 10 + "y" : 10, + "rotation" : -90 }, - "name" : "Contributions", "data" : [ [ "Blog", @@ -24,40 +29,35 @@ ], [ "Perl", - 5448 + 5450 ], [ "Raku", - 3458 + 3460 ] - ] + ], + "name" : "Contributions" } ], + "yAxis" : { + "title" : { + "text" : null + }, + "min" : 0 + }, + "title" : { + "text" : "Perl Weekly Challenge Contributions [2019 - 2020]" + }, "xAxis" : { "type" : "category", "labels" : { "style" : { - "fontFamily" : "Verdana, sans-serif", - "fontSize" : "13px" + "fontSize" : "13px", + "fontFamily" : "Verdana, sans-serif" } } }, - "yAxis" : { - "title" : { - "text" : null - }, - "min" : 0 - }, "tooltip" : { "pointFormat" : "<b>{point.y:.0f}</b>" - }, - "chart" : { - "type" : "column" - }, - "subtitle" : { - "text" : "Last updated at 2021-06-06 22:40:19 GMT" - }, - "title" : { - "text" : "Perl Weekly Challenge Contributions [2019 - 2020]" } } |
