diff options
| author | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2022-10-20 20:03:11 +0100 |
|---|---|---|
| committer | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2022-10-20 20:03:11 +0100 |
| commit | 8f9bc942e0d13ee0bf1d128649f984d20af4c2ff (patch) | |
| tree | df33b312b804ed0634e79ee67436dc88469f764b | |
| parent | 40b6dc593031271cb37a6d061f0a8c36ee373ebf (diff) | |
| download | perlweeklychallenge-club-8f9bc942e0d13ee0bf1d128649f984d20af4c2ff.tar.gz perlweeklychallenge-club-8f9bc942e0d13ee0bf1d128649f984d20af4c2ff.tar.bz2 perlweeklychallenge-club-8f9bc942e0d13ee0bf1d128649f984d20af4c2ff.zip | |
- Added solutions to the week 187.
22 files changed, 2622 insertions, 2116 deletions
diff --git a/challenge-187/mohammad-anwar/java/theweeklychallenge/DaysTogether.java b/challenge-187/mohammad-anwar/java/theweeklychallenge/DaysTogether.java new file mode 100644 index 0000000000..36652ac0a8 --- /dev/null +++ b/challenge-187/mohammad-anwar/java/theweeklychallenge/DaysTogether.java @@ -0,0 +1,90 @@ +package theweeklychallenge; + +/* + +Week 187: + + https://theweeklychallenge.org/blog/perl-weekly-challenge-187 + +Task #1: Days Together + + Two friends, Foo and Bar gone on holidays seperately to the same + city. You are given their schedule i.e. start date and end date. + + To keep the task simple, the date is in the form 'DD-MM' and all + dates belong to the same calendar year i.e. between '01-01' and + '31-12'. + + Also the year is non-leap year and both dates are inclusive. + +Compile and Run: + + mohammad-anwar/java$ javac theweeklychallenge/DaysTogether.java + mohammad-anwar/java$ java theweeklychallenge.DaysTogether + +*/ + +import java.time.LocalDate; +import java.time.temporal.ChronoUnit; +import junit.framework.TestCase; +import static junit.framework.Assert.*; + +public class DaysTogether extends TestCase { + + public static void main(String[] args) { + junit.textui.TestRunner.run( + theweeklychallenge.DaysTogether.class + ); + } + + public void testDaysTogether() { + assertEquals(4, daysTogether("12-01","20-01","15-01","18-01")); + assertEquals(0, daysTogether("02-03","12-03","13-03","14-03")); + assertEquals(2, daysTogether("02-03","12-03","11-03","15-03")); + assertEquals(4, daysTogether("30-03","05-04","28-03","02-04")); + } + + public static int daysTogether( + String sd1, String ed1, String sd2, String ed2) { + LocalDate _sd1 = _date(sd1); + LocalDate _ed1 = _date(ed1); + LocalDate _sd2 = _date(sd2); + LocalDate _ed2 = _date(ed2); + + int days = 0; + + if (_ed1.compareTo(_sd2) < 0) { + return days; + } + + if (_sd2.compareTo(_ed1) > 0) { + days = _daysTogether(_ed1, _ed2, null); + } + else if (_sd1.compareTo(_sd2) > 0) { + days = _daysTogether(_sd1, _ed1, _ed2); + } + else if (_ed2.compareTo(_sd2) > 0) { + days = _daysTogether(_sd2, _ed1, _ed2); + } + + return days; + } + + public static LocalDate _date(String dateStr) { + String[] splitDate = dateStr.split("-"); + int day = Integer.parseInt(splitDate[0]); + int month = Integer.parseInt(splitDate[1]); + + return LocalDate.of(2022, month, day); + } + + public static int _daysTogether( + LocalDate from, LocalDate to, LocalDate _to) { + if ((_to != null) && (to.compareTo(_to) > 0)) { + to = _to; + } + + long days = ChronoUnit.DAYS.between(from, to); + return (int)days + 1; + } +} diff --git a/challenge-187/mohammad-anwar/perl/ch-1.pl b/challenge-187/mohammad-anwar/perl/ch-1.pl new file mode 100644 index 0000000000..e5fcc0afad --- /dev/null +++ b/challenge-187/mohammad-anwar/perl/ch-1.pl @@ -0,0 +1,76 @@ +#!/usr/bin/perl + +=head1 + +Week 187: + + https://theweeklychallenge.org/blog/perl-weekly-challenge-187 + +Task #1: Days Together + + Two friends, Foo and Bar gone on holidays seperately to the same + city. You are given their schedule i.e. start date and end date. + + To keep the task simple, the date is in the form 'DD-MM' and all + dates belong to the same calendar year i.e. between '01-01' and + '31-12'. + + Also the year is non-leap year and both dates are inclusive. + +=cut + +use v5.36; +use DateTime; +use Test2::V0; + +is days_together('12-01','20-01','15-01','18-01'), 4, 'Example 1'; +is days_together('02-03','12-03','13-03','14-03'), 0, 'Example 2'; +is days_together('02-03','12-03','11-03','15-03'), 2, 'Example 3'; +is days_together('30-03','05-04','28-03','02-04'), 4, 'Example 4'; + +done_testing; + +# +# +# METHODS + +sub days_together($sd_1, $ed_1, $sd_2, $ed_2) { + $sd_1 = _date($sd_1); + $ed_1 = _date($ed_1); + $sd_2 = _date($sd_2); + $ed_2 = _date($ed_2); + + my $days = 0; + + return $days if ($ed_1 < $sd_2); + + if ($ed_1 <= $sd_2) { + $days = _days_together($ed_1, $ed_2); + } + elsif ($sd_2 <= $sd_1) { + $days = _days_together($sd_1, $ed_1, $ed_2); + } + elsif ($sd_2 <= $ed_2) { + $days = _days_together($sd_2, $ed_1, $ed_2); + } + + return $days; +} + +sub _date($date) { + my ($day, $month) = split(/\-/, $date, 2); + return DateTime->new( + year => 2022, + month => $month, + day => $day)->truncate(to => 'day'); +} + +sub _days_together($from, $to, $_to) { + my $days = 1; # inclusive day + $to = (defined $_to && ($to > $_to))?($_to):($to); + while ($from < $to) { + $from = $from->add(days => 1); + $days++; + } + return $days; +} diff --git a/challenge-187/mohammad-anwar/perl/ch-2.pl b/challenge-187/mohammad-anwar/perl/ch-2.pl new file mode 100644 index 0000000000..be4269c0c7 --- /dev/null +++ b/challenge-187/mohammad-anwar/perl/ch-2.pl @@ -0,0 +1,61 @@ +#!/usr/bin/perl + +=head1 + +Week 187: + + https://theweeklychallenge.org/blog/perl-weekly-challenge-187 + +Task #2: Magical Triplets + + You are given a list of positive numbers, @n, having at least + 3 numbers. + + Write a script to find the triplets (a, b, c) from the given list + that satisfies the following rules. + + 1. a + b > c + 2. b + c > a + 3. a + c > b + 4. a + b + c is maximum. + + In case, you end up with more than one triplets having the maximum + then pick the triplet where a >= b >= c. + +=cut + +use v5.36; +use Test2::V0; +use Algorithm::Combinatorics qw(variations); + +is magical_triplets(1, 2, 3, 2), [3, 2, 2], 'Example 1'; +is magical_triplets(1, 3, 2), [], 'Example 2'; +is magical_triplets(1, 1, 2, 3), [], 'Example 3'; +is magical_triplets(2, 4, 3), [4, 3, 2], 'Example 4'; + +done_testing; + +# +# +# METHOD + +sub magical_triplets(@list) { + my $triplets = variations([ sort { $b <=> $a } @list ], 3); + my %entries = (); + foreach my $triplet ($triplets->next) { + my ($x, $y, $z) = @$triplet; + if (($x + $y > $z) && + ($y + $z > $x) && + ($x + $z > $y)) { + $entries{join(":", $x, $y, $z)} = $x + $y + $z; + } + } + + return [] unless (keys %entries); + + my $magical = [ + sort { $entries{$b} <=> $entries{$b} } keys %entries + ]; + + return [ split /\:/, $magical->[0] ]; +} diff --git a/challenge-187/mohammad-anwar/python/ch-1.py b/challenge-187/mohammad-anwar/python/ch-1.py new file mode 100644 index 0000000000..f7a8fb24e7 --- /dev/null +++ b/challenge-187/mohammad-anwar/python/ch-1.py @@ -0,0 +1,68 @@ +#!/usr/bin/python3 + +''' + +Week 187: + + https://theweeklychallenge.org/blog/perl-weekly-challenge-187 + +Task #1: Days Together + + Two friends, Foo and Bar gone on holidays seperately to the same + city. You are given their schedule i.e. start date and end date. + + To keep the task simple, the date is in the form 'DD-MM' and all + dates belong to the same calendar year i.e. between '01-01' and + '31-12'. + + Also the year is non-leap year and both dates are inclusive. + +''' + +import unittest +from datetime import date, timedelta + +def _date(dateStr) -> date: + (day, month) = dateStr.split("-") + return date(2022, int(month), int(day)) + +def _days_together(fromDate, toDate, _toDate) -> int: + if _toDate is not None: + if toDate > _toDate: + toDate = _toDate + + delta = toDate - fromDate + return delta.days + 1 + +def daysTogether(sd1, ed1, sd2, ed2) -> int: + _sd1 = _date(sd1) + _ed1 = _date(ed1) + _sd2 = _date(sd2) + _ed2 = _date(ed2) + + days = 0 + + if _ed1 < _sd2: + return days + + if _ed1 <= _sd2: + days = _days_together(_ed1, _ed2) + elif _sd2 <= _sd1: + days = _days_together(_sd1, _ed1, _ed2) + elif _sd2 <= _ed2: + days = _days_together(_sd2, _ed1, _ed2) + + return days + +# +# +# Unit test class + +class TestDaysTogether(unittest.TestCase): + def test_daysTogether(self): + self.assertEqual(daysTogether('12-01','20-01','15-01','18-01'), 4) + self.assertEqual(daysTogether('02-03','12-03','13-03','14-03'), 0) + self.assertEqual(daysTogether('02-03','12-03','11-03','15-03'), 2) + self.assertEqual(daysTogether('30-03','05-04','28-03','02-04'), 4) + +unittest.main() diff --git a/challenge-187/mohammad-anwar/python/ch-2.py b/challenge-187/mohammad-anwar/python/ch-2.py new file mode 100644 index 0000000000..7aefb10fe3 --- /dev/null +++ b/challenge-187/mohammad-anwar/python/ch-2.py @@ -0,0 +1,61 @@ +#!/usr/bin/python3 + +''' + +Week 187: + + https://theweeklychallenge.org/blog/perl-weekly-challenge-187 + +Task #2: Magical Triplets + + You are given a list of positive numbers, @n, having at least + 3 numbers. + + Write a script to find the triplets (a, b, c) from the given list + that satisfies the following rules. + + 1. a + b > c + 2. b + c > a + 3. a + c > b + 4. a + b + c is maximum. + + In case, you end up with more than one triplets having the maximum + then pick the triplet where a >= b >= c. + +''' + +import unittest +import itertools + +def magicalTriplets(array): + array.sort() + magical = {} + for triplet in itertools.permutations(array, 3): + triplet_list = list(triplet) + triplet_list.sort(reverse=True) + a = triplet_list[0] + b = triplet_list[1] + c = triplet_list[2] + if (a + b > c) and (b + c > a) and (a + c > b): + key = ':'.join([str(i) for i in triplet_list]) + val = sum(triplet_list) + magical[key] = val + + if len(magical) == 0: + return [] + + magical_triplet = sorted(magical, key=magical.get, reverse=True)[0] + return [int(i) for i in magical_triplet.split(":")] + +# +# +# Unit test class + +class TestMagicalTriplets(unittest.TestCase): + def test_MagicalTriplets(self): + self.assertEqual(magicalTriplets([1, 2, 3, 2]), [3, 2, 2], 'Example 1') + self.assertEqual(magicalTriplets([1, 3, 2]), [], 'Example 2') + self.assertEqual(magicalTriplets([1, 1, 2, 3]), [], 'Example 3') + self.assertEqual(magicalTriplets([2, 4, 3]), [4, 3, 2], 'Example 4') + +unittest.main() diff --git a/challenge-187/mohammad-anwar/raku/ch-1.raku b/challenge-187/mohammad-anwar/raku/ch-1.raku new file mode 100644 index 0000000000..4bbeabd5e7 --- /dev/null +++ b/challenge-187/mohammad-anwar/raku/ch-1.raku @@ -0,0 +1,71 @@ +#!/usr/bin/env raku + +=begin pod + +Week 187: + + https://theweeklychallenge.org/blog/perl-weekly-challenge-187 + +Task #1: Days Together + + Two friends, Foo and Bar gone on holidays seperately to the same + city. You are given their schedule i.e. start date and end date. + + To keep the task simple, the date is in the form 'DD-MM' and all + dates belong to the same calendar year i.e. between '01-01' and + '31-12'. + + Also the year is non-leap year and both dates are inclusive. + +=end pod + +use Test; + +is days-together('12-01','20-01','15-01','18-01'), 4, 'Example 1'; +is days-together('02-03','12-03','13-03','14-03'), 0, 'Example 2'; +is days-together('02-03','12-03','11-03','15-03'), 2, 'Example 3'; +is days-together('30-03','05-04','28-03','02-04'), 4, 'Example 4'; + +done-testing; + +# +# +# METHODS + +sub days-together(Str $sd1, Str $ed1, Str $sd2, Str $ed2 --> Int) { + my Date $_sd1 = _date($sd1); + my Date $_ed1 = _date($ed1); + my Date $_sd2 = _date($sd2); + my Date $_ed2 = _date($ed2); + + my Int $days = 0; + + return $days if $_ed1 < $_sd2; + + if $_ed1 <= $_sd2 { + $days = _days_together($_ed1, $_ed2); + } + elsif $_sd2 <= $_sd1 { + $days = _days_together($_sd1, $_ed1, $_ed2); + } + elsif $_sd2 <= $_ed2 { + $days = _days_together($_sd2, $_ed1, $_ed2); + } + + return $days; +} + +sub _date(Str $date --> Date) { + my ($day, $month) = $date.split("-"); + return Date.new( + year => 2022, + month => $month, + day => $day + ); +} + +sub _days_together(Date $from, Date $to, Date $_to? --> Int) { + my Date $end_date = $to; + $end_date = $_to if (defined $_to) && ($to > $_to); + return $end_date - $from + 1; +} diff --git a/challenge-187/mohammad-anwar/raku/ch-2.raku b/challenge-187/mohammad-anwar/raku/ch-2.raku new file mode 100644 index 0000000000..03d3369afb --- /dev/null +++ b/challenge-187/mohammad-anwar/raku/ch-2.raku @@ -0,0 +1,60 @@ +#!/usr/bin/env raku + +=begin pod + +Week 187: + + https://theweeklychallenge.org/blog/perl-weekly-challenge-187 + +Task #2: Magical Triplets + + You are given a list of positive numbers, @n, having at least + 3 numbers. + + Write a script to find the triplets (a, b, c) from the given list + that satisfies the following rules. + + 1. a + b > c + 2. b + c > a + 3. a + c > b + 4. a + b + c is maximum. + + In case, you end up with more than one triplets having the maximum + then pick the triplet where a >= b >= c. + +=end pod + +use Test; + +magical-triplets(<1 2 3 2>); + +is magical-triplets(<1 2 3 2>), (3, 2, 2), 'Example 1'; +is magical-triplets(<1 3 2>), (), 'Example 2'; +is magical-triplets(<1 1 2 3>), (), 'Example 3'; +is magical-triplets(<2 4 3>), (4, 3, 2), 'Example 4'; + +done-testing; + +# +# +# METHOD + +sub magical-triplets(@list) { + my %entries = (); + for @list.sort.combinations(3) -> ($x, $y, $z) { + if $x + $y > $z && + $y + $z > $x && + $x + $z > $y { + %entries{"$x:$y:$z"} = $x + $y + $z; + } + } + + return () if %entries.keys.elems == 0; + + return %entries + .sort(*.values) + .tail + .key + .split(":") + .sort: { $^b leg $^a }; +} diff --git a/stats/pwc-current.json b/stats/pwc-current.json index 6e93ec03a6..d593547836 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,121 +1,4 @@ { - "legend" : { - "enabled" : 0 - }, - "tooltip" : { - "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>", - "followPointer" : 1, - "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>" - }, - "title" : { - "text" : "The Weekly Challenge - 187" - }, - "yAxis" : { - "title" : { - "text" : "Total Solutions" - } - }, - "xAxis" : { - "type" : "category" - }, - "subtitle" : { - "text" : "[Champions: 15] Last updated at 2022-10-20 18:52:12 GMT" - }, - "series" : [ - { - "data" : [ - { - "y" : 2, - "drilldown" : "E. Choroba", - "name" : "E. Choroba" - }, - { - "drilldown" : "Humberto Massa", - "y" : 2, - "name" : "Humberto Massa" - }, - { - "drilldown" : "izem", - "y" : 2, - "name" : "izem" - }, - { - "y" : 3, - "drilldown" : "James Smith", - "name" : "James Smith" - }, - { - "name" : "Luca Ferrari", - "y" : 8, - "drilldown" : "Luca Ferrari" - }, - { - "y" : 2, - "drilldown" : "Mark Anderson", - "name" : "Mark Anderson" - }, - { - "drilldown" : "Matthew Neleigh", - "y" : 2, - "name" : "Matthew Neleigh" - }, - { - "name" : "Niels van Dijke", - "y" : 2, - "drilldown" : "Niels van Dijke" - }, - { - "name" : "Peter Campbell Smith", - "y" : 3, - "drilldown" : "Peter Campbell Smith" - }, - { - "y" : 2, - "drilldown" : "Robert DiCicco", - "name" : "Robert DiCicco" - }, - { - "name" : "Robert Ransbottom", - "y" : 2, - "drilldown" : "Robert Ransbottom" - }, - { - "y" : 5, - "drilldown" : "Roger Bell_West", - "name" : "Roger Bell_West" - }, - { - "name" : "Tim Potapov", - "y" : 2, - "drilldown" : "Tim Potapov" - }, - { - "y" : 3, - "drilldown" : "Ulrich Rieke", - "name" : "Ulrich Rieke" - }, - { - "y" : 3, - "drilldown" : "W. Luis Mochan", - "name" : "W. Luis Mochan" - } - ], - "name" : "The Weekly Challenge - 187", - "colorByPoint" : 1 - } - ], - "chart" : { - "type" : "column" - }, - "plotOptions" : { - "series" : { - "dataLabels" : { - "format" : "{point.y}", - "enabled" : 1 - }, - "borderWidth" : 0 - } - }, "drilldown" : { "series" : [ { @@ -129,24 +12,24 @@ ] }, { + "id" : "Humberto Massa", "name" : "Humberto Massa", "data" : [ [ "Raku", 2 ] - ], - "id" : "Humberto Massa" + ] }, { - "id" : "izem", - "name" : "izem", "data" : [ [ "Perl", 2 ] - ] + ], + "id" : "izem", + "name" : "izem" }, { "id" : "James Smith", @@ -173,18 +56,18 @@ 6 ] ], - "name" : "Luca Ferrari", - "id" : "Luca Ferrari" + "id" : "Luca Ferrari", + "name" : "Luca Ferrari" }, { + "name" : "Mark Anderson", "id" : "Mark Anderson", "data" : [ [ "Raku", 2 ] - ], - "name" : "Mark Anderson" + ] }, { "id" : "Matthew Neleigh", @@ -197,17 +80,30 @@ ] }, { - "id" : "Niels van Dijke", - "name" : "Niels van Dijke", "data" : [ [ "Perl", 2 + ], + [ + "Raku", + 2 ] - ] + ], + "id" : "Mohammad S Anwar", + "name" : "Mohammad S Anwar" + }, + { + "data" : [ + [ + "Perl", + 2 + ] + ], + "name" : "Niels van Dijke", + "id" : "Niels van Dijke" }, { - "id" : "Peter Campbell Smith", "data" : [ [ "Perl", @@ -218,10 +114,10 @@ 1 ] ], - "name" : "Peter Campbell Smith" + "name" : "Peter Campbell Smith", + "id" : "Peter Campbell Smith" }, { - "id" : "Robert DiCicco", "data" : [ [ "Perl", @@ -232,20 +128,20 @@ 1 ] ], - "name" : "Robert DiCicco" + "name" : "Robert DiCicco", + "id" : "Robert DiCicco" }, { - "name" : "Robert Ransbottom", "data" : [ [ "Raku", 2 ] ], - "id" : "Robert Ransbottom" + "id" : "Robert Ransbottom", + "name" : "Robert Ransbottom" }, { - "id" : "Roger Bell_West", "data" : [ [ "Perl", @@ -260,20 +156,22 @@ 1 ] ], + "id" : "Roger Bell_West", "name" : "Roger Bell_West" }, { + "name" : "Tim Potapov", + "id" : "Tim Potapov", "data" : [ [ "Perl", 2 ] - ], - "name" : "Tim Potapov", - "id" : "Tim Potapov" + ] }, { "id" : "Ulrich Rieke", + "name" : "Ulrich Rieke", "data" : [ [ "Perl", @@ -283,10 +181,11 @@ "Raku", 2 ] - ], - "name" : "Ulrich Rieke" + ] }, { + "name" : "W. Luis Mochan", + "id" : "W. Luis Mochan", "data" : [ [ "Perl", @@ -296,10 +195,130 @@ "Blog", 1 ] - ], - "name" : "W. Luis Mochan", - "id" : "W. Luis Mochan" + ] } ] - } + }, + "chart" : { + "type" : "column" + }, + "title" : { + "text" : "The Weekly Challenge - 187" + }, + "legend" : { + "enabled" : 0 + }, + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, + "plotOptions" : { + "series" : { + "dataLabels" : { + "format" : "{point.y}", + "enabled" : 1 + }, + "borderWidth" : 0 + } + }, + "subtitle" : { + "text" : "[Champions: 16] Last updated at 2022-10-20 19:00:54 GMT" + }, + "tooltip" : { + "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>", + "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>", + "followPointer" : 1 + }, + "xAxis" : { + "type" : "category" + }, + "series" : [ + { + "name" : "The Weekly Challenge - 187", + "colorByPoint" : 1, + "data" : [ + { + "y" : 2, + "name" : "E. Choroba", + "drilldown" : "E. Choroba" + }, + { + "y" : 2, + "name" : "Humberto Massa", + "drilldown" : "Humberto Massa" + }, + { + "y" : 2, + "drilldown" : "izem", + "name" : "izem" + }, + { + "name" : "James Smith", + "drilldown" : "James Smith", + "y" : 3 + }, + { + "name" : "Luca Ferrari", + "drilldown" : "Luca Ferrari", + "y" : 8 + }, + { + "y" : 2, + "drilldown" : "Mark Anderson", + "name" : "Mark Anderson" + }, + { + "drilldown" : "Matthew Neleigh", + "name" : "Matthew Neleigh", + "y" : 2 + }, + { + "y" : 4, + "drilldown" : "Mohammad S Anwar", + "name" : "Mohammad S Anwar" + }, + { + "drilldown" : "Niels van Dijke", + "name" : "Niels van Dijke", + "y" : 2 + }, + { + "y" : 3, + "name" : "Peter Campbell Smith", + "drilldown" : "Peter Campbell Smith" + }, + { + "y" : 2, + "drilldown" : "Robert DiCicco", + "name" : "Robert DiCicco" + }, + { + "y" : 2, + "drilldown" : "Robert Ransbottom", + "name" : "Robert Ransbottom" + }, + { + "drilldown" : "Roger Bell_West", + "name" : "Roger Bell_West", + "y" : 5 + }, + { + "y" : 2, + "name" : "Tim Potapov", + "drilldown" : "Tim Potapov" + }, + { + "drilldown" : "Ulrich Rieke", + "name" : "Ulrich Rieke", + "y" : 3 + }, + { + "y" : 3, + "name" : "W. Luis Mochan", + "drilldown" : "W. Luis Mochan" + } + ] + } + ] } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index f3e1e54f20..e24a4091df 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -2,32 +2,33 @@ "legend" : { "enabled" : "false" }, - "tooltip" : { - "pointFormat" : "<b>{point.y:.0f}</b>" - }, - "title" : { - "text" : "The Weekly Challenge Contributions [2019 - 2022]" - }, "yAxis" : { + "min" : 0, "title" : { "text" : null - }, - "min" : 0 - }, - "xAxis" : { - "type" : "category", - "labels" : { - "style" : { - "fontFamily" : "Verdana, sans-serif", - "fontSize" : "13px" - } } }, "subtitle" : { - "text" : "Last updated at 2022-10-20 18:52:12 GMT" + "text" : "Last updated at 2022-10-20 19:00:54 GMT" + }, + "tooltip" : { |
