From f346c1cf6d36df41c0c447e8fb8eb0743a27cecf Mon Sep 17 00:00:00 2001
From: wanderdoc <wanderdoc@users.noreply.github.com>
Date: Thu, 19 Jun 2025 18:39:14 +0200
Subject: Create ch-2.pl

---
 challenge-326/wanderdoc/perl/ch-2.pl | 55 ++++++++++++++++++++++++++++++++++++
 1 file changed, 55 insertions(+)
 create mode 100644 challenge-326/wanderdoc/perl/ch-2.pl

diff --git a/challenge-326/wanderdoc/perl/ch-2.pl b/challenge-326/wanderdoc/perl/ch-2.pl
new file mode 100644
index 0000000000..5f1d5d3ca2
--- /dev/null
+++ b/challenge-326/wanderdoc/perl/ch-2.pl
@@ -0,0 +1,55 @@
+#!perl
+use strict;
+use warnings FATAL => qw(all);
+
+=prompt
+You are given an array of positive integers having even elements.
+Write a script to to return the decompress list. To decompress, pick adjacent pair (i, j) and replace it with j, i times.
+
+Example 1
+
+Input: @ints = (1, 3, 2, 4)
+Output: (3, 4, 4)
+
+Pair 1: (1, 3) => 3 one time  => (3)
+Pair 2: (2, 4) => 4 two times => (4, 4)
+
+
+Example 2
+
+Input: @ints = (1, 1, 2, 2)
+Output: (1, 2, 2)
+
+Pair 1: (1, 1) => 1 one time  => (1)
+Pair 2: (2, 2) => 2 two times => (2, 2)
+
+
+Example 3
+
+Input: @ints = (3, 1, 3, 2)
+Output: (1, 1, 1, 2, 2, 2)
+
+Pair 1: (3, 1) => 1 three times => (1, 1, 1)
+Pair 2: (3, 2) => 2 three times => (2, 2, 2)
+
+=cut
+
+
+
+
+
+use Test2::V0 -no_srand => 1;
+
+is(decompressed_list(1, 3, 2, 4), [3, 4, 4], 'Example 1');
+is(decompressed_list(1, 1, 2, 2), [1, 2, 2], 'Example 1');
+is(decompressed_list(3, 1, 3, 2), [1, 1, 1, 2, 2, 2], 'Example 3');
+done_testing();
+
+sub decompressed_list
+{
+     my @arr = @_;
+     return 
+          [map { ($arr[$_ + 1]) x $arr[$_] } 
+          grep { $_ % 2 == 0 }
+          0 .. $#arr];
+}
-- 
cgit