Merge pull request #13236 from mattmartini/branch-for-challenge-352

Solutions for challenge #352

Author: manwar

challenge-352/matt-martini/perl/ch-1.pl

@@ -0,0 +1,72 @@
+#!/usr/bin/env perl
+
+# You are given an array of strings.
+
+# Write a script to return all strings that are a substring of another
+# word in the given array in the order they occur.
+
+use 5.018;
+use strict;
+use warnings;
+use Test2::V0;
+
+plan tests => 5;
+
+sub match_string {
+    my (@words) = @_;
+    diag 'Input: @words = (' . join( ', ', @words ) . ")\n";
+
+    my @results;
+    my %dups;
+
+    MATCH:
+    foreach ( my $i = 0; $i <= $#words; $i++ ) {
+        next MATCH if (++$dups{$words[$i]} > 1);
+        COMPARE:
+        foreach ( my $j = 0; $j <= $#words; $j++ ) {
+            next COMPARE if ( $i == $j );
+            my $indx = index( $words[$j], $words[$i] );
+            if ( $indx != -1 ) {
+                push @results, $words[$i];
+                next MATCH;
+            }
+        }
+    }
+
+    diag 'Output: @results = (' . join( ', ', @results ) . ")\n";
+    return \@results;
+}
+
+is(
+    match_string(
+                   ( "cat", "cats", "dog", "dogcat", "dogcat", "rat", "ratcatdogcat" )
+                ),
+    [ "cat", "dog", "dogcat", "rat" ],
+    'example 1'
+  );
+is(
+    match_string(
+                      ( "hello", "hell", "world", "wor", "ellow", "elloworld" )
+                ),
+    [ "hell", "world", "wor", "ellow" ],
+    'example 2'
+  );
+is(
+    match_string( ( "a", "aa", "aaa", "aaaa" ) ),
+    [ "a", "aa", "aaa" ],
+    'example 3'
+  );
+is(
+    match_string(
+                      ( "flower", "flow", "flight", "fl", "fli", "ig", "ght" )
+                ),
+    [ "flow", "fl", "fli", "ig", "ght" ],
+    'example 4'
+  );
+is(
+    match_string(
+                      ( "car", "carpet", "carpenter", "pet", "enter", "pen", "pent" )
+                ),
+    [ "car", "pet", "enter", "pen", "pent" ],
+    'example 5'
+  );

challenge-352/matt-martini/perl/ch-2.pl

@@ -0,0 +1,70 @@
+#!/usr/bin/env perl
+
+# You are given an array, @nums, where each element is either 0 or 1.
+
+# Define xi as the number formed by taking the first i+1 bits of @nums
+# (from $nums[0] to $nums[i]) and interpreting them as a binary number,
+# with $nums[0] being the most significant bit.
+# Write a script to return an array @answer where $answer[i] is true
+# if x<sub>i</sub> is divisible by 5, otherwise false.
+
+use 5.018;
+use strict;
+use warnings;
+use Test2::V0;
+
+plan tests => 5;
+
+sub binary_prefix {
+    my (@num) = @_;
+    print 'Input: @num = (' . join( ', ', @num ) . ")\n";
+
+    my @answer = ();
+
+    MODULUS:
+    for my $i ( 0 .. $#num ) {
+        my $result = 'false';
+
+        my $binary  = join( '', @num[ 0 .. $i ] );
+        my $decimal = oct( '0b' . $binary );
+        printf( "%12s: %d\n", $binary, $decimal );
+
+        if ( $decimal % 5 == 0 ) {
+            $result = 'true';
+        }
+        push @answer, $result;
+    }
+
+    print 'Output: @answer = (' . join( ', ', @answer ) . ")\n";
+    return \@answer;
+}
+
+is(
+    binary_prefix( ( 0, 1, 1, 0, 0, 1, 0, 1, 1, 1 ) ),
+    [      'true', 'false', 'false', 'false', 'false', 'true',
+           'true', 'false', 'false', 'false'
+    ],
+    'example 1'
+  );
+is(
+    binary_prefix( ( 1, 0, 1, 0, 1, 0 ) ),
+    [ 'false', 'false', 'true', 'true', 'false', 'false' ],
+    'example 2'
+  );
+is(
+    binary_prefix( ( 0, 0, 1, 0, 1 ) ),
+    [ 'true', 'true', 'false', 'false', 'true' ],
+    'example 3'
+  );
+is(
+    binary_prefix( ( 1, 1, 1, 1, 1 ) ),
+    [ 'false', 'false', 'false', 'true', 'false' ],
+    'example 4'
+  );
+is(
+    binary_prefix( ( 1, 0, 1, 1, 0, 1, 0, 0, 1, 1 ) ),
+    [      'false', 'false', 'true',  'false', 'false', 'true',
+           'true',  'true',  'false', 'false'
+    ],
+    'example 5'
+  );