Merge pull request #11992 from jaldhar/challenge-319

Challenge 319 by Jaldhar H. Vyas.

5 files changed, 30 insertions, 0 deletions

diff --git a/challenge-319/jaldhar-h-vyas/blog.txt b/challenge-319/jaldhar-h-vyas/blog.txt
new file mode 100644
index 0000000000..1d85b66713
--- /dev/null
+++ b/challenge-319/jaldhar-h-vyas/blog.txt
@@ -0,0 +1 @@
+https://www.braincells.com/perl/2025/05/perl_weekly_challenge_week_319.html
diff --git a/challenge-319/jaldhar-h-vyas/perl/ch-1.sh b/challenge-319/jaldhar-h-vyas/perl/ch-1.sh
new file mode 100755
index 0000000000..a19b0739c3
--- /dev/null
+++ b/challenge-319/jaldhar-h-vyas/perl/ch-1.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+
+perl -E 'say 0+grep{/^[aeiou]|[aeiou]$/}@ARGV' "$@"
diff --git a/challenge-319/jaldhar-h-vyas/perl/ch-2.pl b/challenge-319/jaldhar-h-vyas/perl/ch-2.pl
new file mode 100755
index 0000000000..cced014c1b
--- /dev/null
+++ b/challenge-319/jaldhar-h-vyas/perl/ch-2.pl
@@ -0,0 +1,20 @@
+#!/usr/bin/perl
+use v5.38;
+
+sub intersection($arr1, $arr2) {
+    my %intersection;
+    for my $i (@{$arr1}, @{$arr2}) {
+        $intersection{$i}++;
+    }
+
+    return grep { $intersection{$_} > 1 } keys %intersection;
+}
+
+sub min(@arr) {
+    return (sort { $a <=> $b } @arr)[0];
+}
+
+my @array_1 = split /\s+/, shift;
+my @array_2 = split /\s+/, shift;
+
+say min(intersection(\@array_1, \@array_2)) || -1;
\ No newline at end of file
diff --git a/challenge-319/jaldhar-h-vyas/raku/ch-1.sh b/challenge-319/jaldhar-h-vyas/raku/ch-1.sh
new file mode 100755
index 0000000000..4d2f57766d
--- /dev/null
+++ b/challenge-319/jaldhar-h-vyas/raku/ch-1.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+
+raku -e '@*ARGS.grep({$_.match(/^<[aeiou]>||<[aeiou]>$/)}).elems.say' "$@"
diff --git a/challenge-319/jaldhar-h-vyas/raku/ch-2.sh b/challenge-319/jaldhar-h-vyas/raku/ch-2.sh
new file mode 100755
index 0000000000..a270965cbe
--- /dev/null
+++ b/challenge-319/jaldhar-h-vyas/raku/ch-2.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+
+raku -e '((@*ARGS[0].words∩@*ARGS[1].words).keys||(-1)).min.say' "$@"