- Added solutions by Luca Ferrari.

- Added solutions by David Ferrone.
- Added solutions by Dave Jacoby.
- Added solutions by Mark Anderson.
- Added solutions by Thomas Kohler.
- Added solutions by Robert Ransbottom.
- Added solutions by W. Luis Mochan.
- Added solutions by Ulrich Rieke.
- Added solutions by Olivier Delouya.
- Added solutions by Robert DiCicco.

31 files changed, 2848 insertions, 2154 deletions

diff --git a/challenge-195/eric-cheung/python/ch-1.py b/challenge-195/eric-cheung/python/ch-1.py
new file mode 100755
index 0000000000..4839f6f0fc
--- /dev/null
+++ b/challenge-195/eric-cheung/python/ch-1.py
@@ -0,0 +1,30 @@
+

+def IsNumSpecial(nInput):

+

+    if nInput < 11:

+        return True

+

+    arrList = list(map(int, str(nInput)))

+    arrUniqList = list(set(arrList))

+

+    for nLoop in arrUniqList:

+        if arrList.count(nLoop) > 1:

+            return False

+

+    return True

+

+def nCountNumSpecial(nNum):

+

+    arrOutputList = []

+

+    for nVar in range(1, nNum + 1):

+        if IsNumSpecial(nVar):

+            arrOutputList.append(nVar)

+

+    return len(arrOutputList)

+

+

+## nGivenInput = 15  ## Example 1

+nGivenInput = 35  ## Example 2

+

+print (nCountNumSpecial(nGivenInput))

diff --git a/challenge-195/eric-cheung/python/ch-2.py b/challenge-195/eric-cheung/python/ch-2.py
new file mode 100755
index 0000000000..b141abef13
--- /dev/null
+++ b/challenge-195/eric-cheung/python/ch-2.py
@@ -0,0 +1,20 @@
+

+nArrList = [1, 1, 2, 6, 2]  ## Example 1

+## nArrList = [1, 3, 5, 7]  ## Example 2

+## nArrList = [6, 4, 4, 6, 1]  ## Example 3

+

+nArrEvenList = [nLoop for nLoop in nArrList if nLoop % 2 == 0]

+nArrUniqEvenList = list(set(nArrEvenList))

+

+nSmallEvenNum = -1

+nEvenNumCount = 0

+

+for nLoop in nArrUniqEvenList:

+

+    nCount = nArrEvenList.count(nLoop)

+

+    if nCount > nEvenNumCount and (nLoop < nSmallEvenNum or nSmallEvenNum < 0):

+        nSmallEvenNum = nLoop

+        nEvenNumCount = nCount

+

+print (nSmallEvenNum)

diff --git a/challenge-195/olivier-delouya/perl/ch-1.sh b/challenge-195/olivier-delouya/perl/ch-1.sh
new file mode 100644
index 0000000000..3d8096e886
--- /dev/null
+++ b/challenge-195/olivier-delouya/perl/ch-1.sh
@@ -0,0 +1,5 @@
+WC192_1='@list = eval($list); $min = -1; foreach(@list) { $min = $_ if(!($_ & 1) && ($min == -1 || $_ < $min)); }; print $min;'
+
+perl -se "$WC192_1" -- -list="(1,1,2,6,2)"
+perl -se "$WC192_1" -- -list="(1,3,5,7)"
+perl -se "$WC192_1" -- -list="(6,4,4,6,1)"
diff --git a/challenge-195/robert-dicicco/perl/ch-1.pl b/challenge-195/robert-dicicco/perl/ch-1.pl
new file mode 100644
index 0000000000..8f701ca985
--- /dev/null
+++ b/challenge-195/robert-dicicco/perl/ch-1.pl
@@ -0,0 +1,77 @@
+#!/usr/bin/env perl
+
+=begin pod
+
+AUTHOR: Robert DiCicco
+
+DATE: 2022-12-12
+
+Challenge 195 Special Integers ( Perl )
+
+ 
+
+SAMPLE OUTPUT
+
+ 
+
+perl .\SpecialIntegers.pl
+
+Input: $n = 15
+
+Output: 14
+
+ 
+
+Input: $n = 35
+
+Output: 32
+
+=cut
+
+ 
+
+use strict;
+
+use warnings;
+
+use feature qw/say/;
+
+ 
+
+sub CheckUniqDigits {
+
+  my $n = shift;
+
+  my %h1 = ();
+
+  my @arr = split("",$n);
+
+  foreach my $val (split("",$n)){
+
+    exists $h1{$val} ? return 0 : $h1{$val}++;
+
+  }
+
+  return 1;
+
+}
+
+ 
+
+foreach my $input (15, 35) {
+
+  my $output = 0;
+
+  print "Input: \$n = $input\n";
+
+  for my $n (1..$input) {
+
+    $output += CheckUniqDigits($n);
+
+  }
+
+  print "Output: $output\n\n";
+
+}
+
+ 
diff --git a/challenge-195/robert-dicicco/raku/ch-1.raku b/challenge-195/robert-dicicco/raku/ch-1.raku
new file mode 100644
index 0000000000..3e01f2e7e1
--- /dev/null
+++ b/challenge-195/robert-dicicco/raku/ch-1.raku
@@ -0,0 +1,63 @@
+use v6;
+
+#`{
+
+  AUTHOR: Robert DiCicco
+
+  DATE: 2022-12-12
+
+  Challenge 195 Special Integers ( Perl )
+
+ 
+
+  SAMPLE OUTPUT
+
+  raku .\SpecialIntegers.rk
+
+  Input: $n = 15
+
+  Output: 14
+
+ 
+
+  Input: $n = 35
+
+  Output: 32
+
+}
+
+ 
+
+sub CheckUniqDigits($n) {
+
+  my %h1 = ();
+
+  my @arr = $n.comb;
+
+  for (@arr) -> $val {
+
+    %h1.EXISTS-KEY($val) ?? return 0 !! %h1{$val}++;
+
+  }
+
+  return 1;
+
+}
+
+ 
+
+for <15 35> -> $input {
+
+  my $output = 0;
+
+  print "Input: \$n = $input\n";
+
+  for 1..$input -> $i {
+
+    $output += CheckUniqDigits($i);
+
+  }
+
+  print "Output: $output\n\n";
+
+}
diff --git a/challenge-195/ulrich-rieke/cpp/ch-1.cpp b/challenge-195/ulrich-rieke/cpp/ch-1.cpp
new file mode 100644
index 0000000000..0d6fcd8ac6
--- /dev/null
+++ b/challenge-195/ulrich-rieke/cpp/ch-1.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <map>
+#include <vector>
+#include <utility>
+#include <algorithm>
+#include <cstdlib>
+
+bool isSpecial( int n ) {
+  if ( n < 10 ) {
+      return true ;
+  }
+  else {
+      std::map<int, int> frequencies ;
+      while ( n != 0 ) {
+    frequencies[ n % 10]++ ;
+    n /= 10 ;
+      }
+      std::vector<std::pair<int , int>> allPairs( frequencies.begin( ) ,
+        frequencies.end( ) ) ;
+      return std::all_of( allPairs.begin( ) , allPairs.end( ) , [] ( auto &
+          p ) { return p.second == 1 ; } ) ;
+  }
+}
+
+int main( int argc , char * argv[] ) {
+  int num = std::atoi( argv[1] ) ;
+  int count = 0 ;
+  for ( int i = 1 ; i < num + 1 ; i++ ) {
+      if ( isSpecial( i ) ) {
+    count++ ;
+      }
+  }
+  std::cout << count << std::endl ;
+  return 0 ;
+}
diff --git a/challenge-195/ulrich-rieke/cpp/ch-2.cpp b/challenge-195/ulrich-rieke/cpp/ch-2.cpp
new file mode 100644
index 0000000000..befdd7eb11
--- /dev/null
+++ b/challenge-195/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,54 @@
+#include <iostream>
+#include <string>
+#include <map>
+#include <utility>
+#include <algorithm>
+#include <vector>
+
+std::vector<std::string> split( const std::string & startline , const std::string & sep ) {
+  std::vector<std::string> separated ;
+  std::string::size_type start { 0 } ;
+  std::string::size_type pos ;
+  do {
+      pos = startline.find_first_of( sep , start ) ;
+      separated.push_back( startline.substr(start , pos - start )) ;
+      start = pos + 1 ;
+  } while ( pos != std::string::npos ) ;
+  return separated ;
+}
+
+int main( ) {
+  std::cout << "Please enter some integers, separated by blanks!\n" ;
+  std::string line ;
+  std::getline( std::cin , line ) ;
+  std::vector<int> evens ;
+  std::vector<std::string> numberstrings( split( line , " " ) ) ;
+  for ( auto & s : numberstrings ) {
+      int num = std::stoi( s ) ;
+      if ( num % 2 == 0 )
+    evens.push_back( num ) ;
+  }
+  if ( evens.size( ) != 0 ) {
+      std::map<int , int> frequencies ;
+      for ( int i : evens ) {
+    frequencies[ i ]++ ;
+      }
+      std::vector<std::pair<int , int>> allFrequencies ( frequencies.begin( ),
+        frequencies.end( ) ) ;
+      std::sort ( allFrequencies.begin( ) , allFrequencies.end( ) ,
+        [ ] ( const auto & a, const auto & b ) { return a.second
+        > b.second ; } ) ;
+      if ( allFrequencies.begin( )->second !=
+        (allFrequencies.begin( ) + 1)->second ) {
+    std::cout << allFrequencies.begin( )->first << std::endl ;
+      }
+      else {
+    std::sort( evens.begin( ) , evens.end( ) ) ;
+    std::cout << *evens.begin( ) << std::endl ;
+      }
+  }
+  else {
+      std::cout << -1 << std::endl ;
+  }
+  return 0 ;
+}
diff --git a/challenge-195/ulrich-rieke/haskell/ch-1.hs b/challenge-195/ulrich-rieke/haskell/ch-1.hs
new file mode 100644
index 0000000000..193516b251
--- /dev/null
+++ b/challenge-195/ulrich-rieke/haskell/ch-1.hs
@@ -0,0 +1,11 @@
+module Challenge195
+  where
+import Data.List ( group, sort )
+
+isSpecial :: Int -> Bool
+isSpecial n
+  |n < 10 = True
+  |otherwise = all (\li -> length li == 1 ) $ group $ sort $ show n
+
+solution :: Int -> Int
+solution n = length $ filter isSpecial [1..n]
diff --git a/challenge-195/ulrich-rieke/haskell/ch-2.hs b/challenge-195/ulrich-rieke/haskell/ch-2.hs
new file mode 100644
index 0000000000..adcfddb4b1
--- /dev/null
+++ b/challenge-195/ulrich-rieke/haskell/ch-2.hs
@@ -0,0 +1,21 @@
+module Challenge195_2
+  where
+import qualified Data.Set as S
+import Data.List ( (!!) , sortOn )
+
+count :: Eq a => a -> [a] -> Int
+count el list = length $ filter ( == el ) list
+
+solution :: [Int] -> Int 
+solution numbers
+  |null uniqueEvens = -1
+  |otherwise = if  snd  (pairs !! 0)  /=  snd (pairs !! 1 )  then
+    fst (pairs !! 0 ) else smallest
+      where
+      uniqueEvens :: [Int]
+      uniqueEvens = S.toList $ S.fromList $ filter even numbers
+      pairs :: [(Int , Int)]
+      pairs = reverse $ sortOn snd $ zip uniqueEvens ( map
+      (\i -> count i numbers ) uniqueEvens )
+      smallest :: Int
+      smallest = minimum uniqueEvens
diff --git a/challenge-195/ulrich-rieke/perl/ch-1.pl b/challenge-195/ulrich-rieke/perl/ch-1.pl
new file mode 100644
index 0000000000..0782e6b2b5
--- /dev/null
+++ b/challenge-195/ulrich-rieke/perl/ch-1.pl
@@ -0,0 +1,30 @@
+#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use List::Util qw ( all ) ;
+use POSIX ;
+
+sub isSpecial {
+  my $number = shift ;
+  if ( $number < 10 ) {
+      return 1 ;
+  }
+  else {
+      my %frequencies ;
+      while ( $number != 0 ) {
+    $frequencies{ $number % 10 }++ ;
+    $number = floor( $number / 10 ) ;
+      }
+      return all { $_ == 1 } values %frequencies ;
+  }
+}
+
+my $num = $ARGV[0] ;
+my $count = 0 ;
+for my $i ( 1 .. $num ) {
+  if ( isSpecial( $i ) ) {
+      $count++ ;
+  }
+}
+say $count ;
diff --git a/challenge-195/ulrich-rieke/perl/ch-2.pl b/challenge-195/ulrich-rieke/perl/ch-2.pl
new file mode 100644
index 0000000000..3a8440dc5e
--- /dev/null
+++ b/challenge-195/ulrich-rieke/perl/ch-2.pl
@@ -0,0 +1,33 @@
+#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s/ , $line ) ;
+my @evens = grep { $_ % 2 == 0 } @numbers ;
+if ( @evens ) {
+  my %frequencies ;
+  for my $n ( @evens ) {
+      $frequencies{$n}++ ;
+  }
+  my @sorted  ;
+#sort in descending order of frequency
+  foreach my $num ( sort { $frequencies{ $b } <=> $frequencies{ $a }} keys
+    %frequencies ) {
+      push @sorted , $num ;
+  }
+#that means the front 2 numbers are the largest
+  if ( $sorted[0] != $sorted[1] ) {
+      say $sorted[0] ;
+  }
+  else {
+      my @sorted = sort { $a <=> $b } @evens ;
+      say $sorted[0] ;
+  }
+}
+else {
+  say -1 ;
+}
diff --git a/challenge-195/ulrich-rieke/raku/ch-1.raku b/challenge-195/ulrich-rieke/raku/ch-1.raku
new file mode 100644
index 0000000000..61536ffc0f
--- /dev/null
+++ b/challenge-195/ulrich-rieke/raku/ch-1.raku
@@ -0,0 +1,26 @@
+use v6 ;
+
+sub isSpecial( Int $n is copy --> Bool ) {
+  if ( $n < 10 ) {
+      return True ;
+  }
+  else {
+      my %frequencies ;
+      while ( $n != 0 ) {
+    %frequencies{ $n % 10 }++ ;
+    $n div= 10 ;
+      }
+      my @vals = %frequencies.values ;
+      return @vals.grep( { $_ == 1 } ).elems == @vals.elems ;
+  }
+}
+
+sub MAIN( Int $number ) {
+  my $count = 0 ;
+  for (1 .. $number ) -> $i {
+      if ( isSpecial( $i ) ) {
+    $count++ ;
+      }
+  }
+  say $count ;
+}
diff --git a/challenge-195/ulrich-rieke/raku/ch-2.raku b/challenge-195/ulrich-rieke/raku/ch-2.raku
new file mode 100644
index 0000000000..2ad1f4cb33
--- /dev/null
+++ b/challenge-195/ulrich-rieke/raku/ch-2.raku
@@ -0,0 +1,25 @@
+use v6 ;
+
+say "Enter some integers, separated by space!" ;
+my $line = $*IN.get ;
+my @numbers = $line.split( /\s/ ).map( {.Int} ) ;
+my %frequencies ;
+my @evens = @numbers.grep( { $_ %% 2 } ) ;
+if ( @evens ) {
+  for @evens -> $n {
+      %frequencies{ $n }++ ;
+  }
+#sort in ascending order of frequency
+  my @sorted = %frequencies.keys.sort: { %frequencies{$_} } ;
+#so the last 2 numbers are the largest
+  if ( @sorted[ *-1 ] != @sorted[ *-2 ] ) {
+      say @sorted[*-1] ;
+  }
+  else {
+      @sorted = @evens.sort ;
+      say @sorted[0] ;
+  }
+}
+else {
+  say -1 ;
+}
diff --git a/challenge-195/ulrich-rieke/rust/ch-1.rs b/challenge-195/ulrich-rieke/rust/ch-1.rs
new file mode 100644
index 0000000000..054c47470f
--- /dev/null
+++ b/challenge-195/ulrich-rieke/rust/ch-1.rs
@@ -0,0 +1,34 @@
+use std::io ;
+use std::collections::HashMap ;
+
+fn is_special( num : i32 ) -> bool {
+  if num < 10 {
+      true
+  }
+  else {
+      let mut digit_count = HashMap::new( ) ;
+      let mut n = num ;
+      while n != 0 {
+    let counter = digit_count.entry( n % 10 ).or_insert( 0 ) ;
+    *counter += 1 ;
+    n /= 10 ;
+      }
+      let freq_count : Vec<(i32, i32)> = digit_count.into_iter( ).collect( ) ;
+      freq_count.iter( ).all( | p | p.1 == 1 )
+  }
+}
+
+fn main() {
+    println!("Please enter an integer greater than 0 !");
+    let mut inline : String = String::new( ) ;
+    io::stdin( ).read_line( &mut inline ).unwrap( ) ;
+    let entered_line : &str = &*inline ;
+    let number : i32 = entered_line.trim( ).parse::<i32>( ).unwrap( ) ;
+    let mut count : i32 = 0 ;
+    for i in 1..=number {
+      if is_special( i ) {
+      count += 1 ;
+      }
+    }
+    println!("{}" , count ) ;
+}
diff --git a/challenge-195/ulrich-rieke/rust/ch-2.rs b/challenge-195/ulrich-rieke/rust/ch-2.rs
new file mode 100644
index 0000000000..5140b4dace
--- /dev/null
+++ b/challenge-195/ulrich-rieke/rust/ch-2.rs
@@ -0,0 +1,33 @@
+use std::io ;
+use std::collections::HashMap ;
+
+fn main() {
+  let mut input : String = String::new( ) ;
+  println!("Please enter some integers, separated by a space!");
+  io::stdin( ).read_line( &mut input ).unwrap( ) ;
+  let entered_line : &str = &*input ;
+  let numbers : Vec<i32> = entered_line.split_whitespace( ).map( | s |
+    s.trim( ).parse::<i32>( ).unwrap( )).collect( ) ;
+  let mut evens : Vec<i32> = Vec::new( ) ;
+  numbers.iter( ).filter( | &d | *d % 2 == 0).for_each( | i |
+    evens.push( *i )) ;
+  if evens.len( ) != 0 {
+      let mut evens_freq = HashMap::new( ) ;
+      for d in &evens {
+    let counter = evens_freq.entry( d ).or_insert( 0 ) ;
+    *counter += 1 ;
+      }
+      let mut freq_count : Vec<(&i32, i32)> = evens_freq.into_iter( ).collect( ) ;
+      freq_count.sort_by( | a , b | b.1.cmp( &a.1 ) ) ;
+      if freq_count[0].1 != freq_count[1].1 {
+    println!("{}" , freq_count[0].0 ) ;
+      }
+      else {
+    evens.sort( ) ;
+    println!("{}" , evens[0] ) ;
+      }
+  }
+  else {
+      println!("-1") ;
+  }
+}
diff --git a/challenge-195/ziameraj16/java/MostFrequentEven.java b/challenge-195/ziameraj16/java/MostFrequentEven.java
new file mode 100644
index 0000000000..794e6f545d
--- /dev/null
+++ b/challenge-195/ziameraj16/java/MostFrequentEven.java
@@ -0,0 +1,31 @@
+import java.util.*;
+import java.util.stream.Collectors;
+
+public class MostFrequentEven {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.println("Enter comma separated values");
+        List<Integer> list = Arrays.stream(scanner.nextLine().split(",")).map(Integer::valueOf).collect(Collectors.toList());
+        Map<Integer, Integer> map = new HashMap();
+        for (int i : list) {
+            if (i % 2 == 0) {
+                if (map.containsKey(i)) {
+                    map.put(i, map.get(i) + 1);
+                } else {
+                    map.put(i, 1);
+                }
+            }
+        }
+        if (map.isEmpty()) {
+            System.out.println("Output: -1");
+        } else {
+            List<Map.Entry<Integer, Integer>> sorted =
+                    map.entrySet().stream()
+                            .sorted(Collections.reverseOrder(Map.Entry.comparingByValue()))
+                            .sorted(Map.Entry.comparingByKey()).collect(Collectors.toList());
+            System.out.println(sorted.get(0).getKey());
+        }
+
+    }
+}
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index 01229fb000..8df78b2854 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -1,26 +1,156 @@
 {
+   "xAxis" : {
+      "type" : "category"
+   },
    "yAxis" : {
       "title" : {
          "text" : "Total Solutions"
       }
    },
-   "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 - 195"
-   },
-   "legend" : {
-      "enabled" : 0
-   },
-   "subtitle" : {
-      "text" : "[Champions: 1] Last updated at 2022-12-13 11:46:59 GMT"
-   },
+   "series" : [
+      {
+         "colorByPoint" : 1,
+         "data" : [
+            {
+               "name" : "Dave Jacoby",
+               "y" : 2,
+               "drilldown" : "Dave Jacoby"
+            },
+            {
+               "name" : "David Ferrone",
+               "y" : 2,
+               "drilldown" : "David Ferrone"
+            },
+            {
+               "y" : 8,
+               "drilldown" : "Luca Ferrari",
+               "name" : "Luca Ferrari"
+            },
+            {
+               "drilldown" : "Mark Anderson",
+               "y" : 2,
+               "name" : "Mark Anderson"
+            },
+            {
+               "name" : "Olivier Delouya",
+               "drilldown" : "Olivier Delouya",
+               "y" : 1
+            },
+            {
+               "name" : "Robert DiCicco",
+               "drilldown" : "Robert DiCicco",
+               "y" : 2
+            },
+            {
+               "drilldown" : "Robert Ransbottom",
+               "y" : 2,
+               "name" : "Robert Ransbottom"
+            },
+            {
+               "name" : "Roger Bell_West",
+               "y" : 4,
+               "drilldown" : "Roger Bell_West"
+            },
+            {
+               "y" : 2,
+               "drilldown" : "Thomas Kohler",
+               "name" : "Thomas Kohler"
+            },
+            {
+               "y" : 4,
+               "drilldown" : "Ulrich Rieke",
+               "name" : "Ulrich Rieke"
+            },
+            {
+               "name" : "W. Luis Mochan",
+               "drilldown" : "W. Luis Mochan",
+               "y" : 3
+            }
+         ],
+         "name" : "The Weekly Challenge - 195"
+      }
+   ],
    "drilldown" : {
       "series" : [
          {
+            "data" : [
+               [
+                  "Perl",
+                  2
+               ]
+            ],
+            "name" : "Dave Jacoby",
+            "id" : "Dave Jacoby"
+         },
+         {
+            "id" : "David Ferrone",
+            "data" : [
+               [
+                  "Perl",
+                  2
+               ]
+            ],
+            "name" : "David Ferrone"
+         },
+         {
+            "data" : [
+               [
+                  "Raku",
+                  2
+               ],
+               [
+                  "Blog",
+                  6
+               ]
+            ],
+            "name" : "Luca Ferrari",
+            "id" : "Luca Ferrari"
+         },
+         {
+            "id" : "Mark Anderson",
+            "data" : [
+               [
+                  "Raku",
+                  2
+               ]
+            ],
+            "name" : "Mark Anderson"
+         },
+         {
+            "data" : [
+               [
+                  "Perl",
+                  1
+               ]
+            ],
+            "name" : "Olivier Delouya",
+            "id" : "Olivier Delouya"
+         },
+         {
+            "name" : "Robert DiCicco",
+            "data" : [
+               [
+                  "Perl",
+                  1
+               ],
+               [
+                  "Raku",
+                  1
+               ]
+            ],
+            "id" : "Robert DiCicco"
+         },
+         {
+            "name" : "Robert Ransbottom",
+            "data" : [
+               [
+                  "Raku",
+                  2
+               ]
+            ],
+            "id" : "Robert Ransbottom"
+         },
+         {
             "id" : "Roger Bell_West",
             "data" : [
                [
@@ -33,35 +163,71 @@
                ]
             ],
             "name" : "Roger Bell_West"
+         },
+         {
+            "data" : [
+               [
+                  "Perl",
+                  2
+               ]
+            ],
+            "name" : "Thomas Kohler",
+            "id" : "Thomas Kohler"
+         },
+         {
+            "id" : "Ulrich Rieke",
+            "data" : [
+               [
+                  "Perl",
+                  2
+               ],
+               [
+                  "Raku",
+                  2
+               ]
+            ],
+            "name" : "Ulrich Rieke"
+         },
+         {
+            "id" : "W. Luis Mochan",
+            "data" : [
+               [
+                  "Perl",
+                  2
+               ],
+               [
+                  "Blog",
+                  1
+               ]
+            ],
+            "name" : "W. Luis Mochan"
          }
       ]
    },
-   "xAxis" : {
-      "type" : "category"
-   },
-   "series" : [
-      {
-         "name" : "The Weekly Challenge - 195",
-         "data" : [
-            {
-               "drilldown" : "Roger Bell_West",
-               "name" : "Roger Bell_West",
-               "y" : 4
-            }
-         ],
-         "colorByPoint" : 1
-      }
-   ],
-   "chart" : {
-      "type" : "column"
+   "subtitle" : {
+      "text" : "[Champions: 11] Last updated at 2022-12-13 12:22:29 GMT"
    },
    "plotOptions" : {
       "series" : {
          "dataLabels" : {
-            "enabled" : 1,
-            "format" : "{point.y}"
+            "format" : "{point.y}",
+            "enabled" : 1
          },
          "borderWidth" : 0
       }
+   },
+   "chart" : {
+      "type" : "column"
+   },
+   "title" : {
+      "text" : "The Weekly Challenge - 195"
+   },
+   "legend" : {
+      "enabled" : 0
+   },
+   "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
    }
 }
diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json
index eea331eaf9..0e98a102f2 100644
--- a/stats/pwc-language-breakdown-summary.json
+++ b/stats/pwc-language-breakdown-summary.json
@@ -1,46 +1,26 @@
 {
-   "title" : {
-      "text" : "The Weekly Challenge Contributions [2019 - 2022]"
-   },
-   "legend" : {
-      "enabled" : "false"
-   },
-   "yAxis" : {
-      "title" : {
-         "text" : null
-      },
-      "min" : 0
-   },
-   "tooltip" : {
-      "pointFormat" : "<b>{p