diff options
| -rwxr-xr-x | challenge-334/peter-meszaros/perl/ch-1.pl | 82 | ||||
| -rwxr-xr-x | challenge-334/peter-meszaros/perl/ch-2.pl | 125 | ||||
| -rwxr-xr-x | challenge-334/peter-meszaros/tcl/ch-1.tcl | 84 | ||||
| -rwxr-xr-x | challenge-334/peter-meszaros/tcl/ch-2.tcl | 125 |
4 files changed, 416 insertions, 0 deletions
diff --git a/challenge-334/peter-meszaros/perl/ch-1.pl b/challenge-334/peter-meszaros/perl/ch-1.pl new file mode 100755 index 0000000000..b93eb279be --- /dev/null +++ b/challenge-334/peter-meszaros/perl/ch-1.pl @@ -0,0 +1,82 @@ +#!/usr/bin/env perl +# +=head1 Task 1: Range Sum + +Submitted by: Mohammad Sajid Anwar + +You are given a list integers and pair of indices.. + +Write a script to return the sum of integers between the given indices +(inclusive). + +=head2 Example 1 + + Input: @ints = (-2, 0, 3, -5, 2, -1), $x = 0, $y = 2 + Output: 1 + + Elements between indices (0, 2) => (-2, 0, 3) + Range Sum: (-2) + 0 + 3 => 1 + +=head2 Example 2 + + Input: @ints = (1, -2, 3, -4, 5), $x = 1, $y = 3 + Output: -3 + + Elements between indices (1, 3) => (-2, 3, -4) + Range Sum: (-2) + 3 + (-4) => -3 + +=head2 Example 3 + + Input: @ints = (1, 0, 2, -1, 3), $x = 3, $y = 4 + Output: 2 + + Elements between indices (3, 4) => (-1, 3) + Range Sum: (-1) + 3 => 2 + +=head2 Example 4 + + Input: @ints = (-5, 4, -3, 2, -1, 0), $x = 0, $y = 3 + Output: -2 + + Elements between indices (0, 3) => (-5, 4, -3, 2) + Range Sum: (-5) + 4 + (-3) + 2 => -2 + +=head2 Example 5 + + Input: @ints = (-1, 0, 2, -3, -2, 1), $x = 0, $y = 2 + Output: 1 + + Elements between indices (0, 2) => (-1, 0, 2) + Range Sum: (-1) + 0 + 2 => 1 + +=cut + +use strict; +use warnings; +use Test2::V0 -no_srand => 1; +use Data::Dumper; +use List::Util qw/sum0/; + +my $cases = [ + [[[-2, 0, 3, -5, 2, -1], [0, 2]], 1, "Example 1"], + [[[ 1, -2, 3, -4, 5], [1, 3]], -3, "Example 2"], + [[[ 1, 0, 2, -1, 3], [3, 4]], 2, "Example 3"], + [[[-5, 4, -3, 2, -1, 0], [0, 3]], -2, "Example 4"], + [[[-1, 0, 2, -3, -2, 1], [0, 2]], 1, "Example 5"], +]; + +sub range_sum +{ + my $ints = $_[0]->[0]; + my $x = $_[0]->[1]->[0]; + my $y = $_[0]->[1]->[1]; + + return sum0($ints->@[$x .. $y]); +} + +for (@$cases) { + is(range_sum($_->[0]), $_->[1], $_->[2]); +} +done_testing(); + +exit 0; diff --git a/challenge-334/peter-meszaros/perl/ch-2.pl b/challenge-334/peter-meszaros/perl/ch-2.pl new file mode 100755 index 0000000000..c6233c695a --- /dev/null +++ b/challenge-334/peter-meszaros/perl/ch-2.pl @@ -0,0 +1,125 @@ +#!/usr/bin/env perl +# +=head1 Task 2: Nearest Valid Point + +Submitted by: Mohammad Sajid Anwar + +You are given current location as two integers: x and y. You are also given a +list of points on the grid. + +A point is considered valid if it shares either the same x-coordinate or the +same y-coordinate as the current location. + +Write a script to return the index of the valid point that has the smallest +Manhattan distance to the current location. If multiple valid points are tied +for the smallest distance, return the one with the lowest index. If no valid +points exist, return -1. + +The Manhattan distance between two points (x1, y1) and (x2, y2) is calculated +as: |x1 - x2| + |y1 - y2| + +=head2 Example 1 + + Input: $x = 3, $y = 4, @points ([1, 2], [3, 1], [2, 4], [2, 3]) + Output: 2 + + Valid points: [3, 1] (same x), [2, 4] (same y) + + Manhattan distances: + [3, 1] => |3-3| + |4-1| = 3 + [2, 4] => |3-2| + |4-4| = 1 + + Closest valid point is [2, 4] at index 2. + +=head2 Example 2 + + Input: $x = 2, $y = 5, @points ([3, 4], [2, 3], [1, 5], [2, 5]) + Output: 3 + + Valid points: [2, 3], [1, 5], [2, 5] + + Manhattan distances: + [2, 3] => 2 + [1, 5] => 1 + [2, 5] => 0 + + Closest valid point is [2, 5] at index 3. + +=head2 Example 3 + + Input: $x = 1, $y = 1, @points ([2, 2], [3, 3], [4, 4]) + Output: -1 + + No point shares x or y with (1, 1). + +=head2 Example 4 + + Input: $x = 0, $y = 0, @points ([0, 1], [1, 0], [0, 2], [2, 0]) + Output: 0 + + Valid points: all of them + + Manhattan distances: + [0, 1] => 1 + [1, 0] => 1 + [0, 2] => 2 + [2, 0] => 2 + + Tie between index 0 and 1, pick the smaller index: 0 + +=head2 Example 5 + + Input: $x = 5, $y = 5, @points ([5, 6], [6, 5], [5, 4], [4, 5]) + Output: 0 + + Valid points: all of them + [5, 6] => 1 + [6, 5] => 1 + [5, 4] => 1 + [4, 5] => 1 + + All tie, return the one with the lowest index: 0 + +=cut + +use strict; +use warnings; +use Test2::V0 -no_srand => 1; +use Data::Dumper; + +my $cases = [ + [[[3, 4], [[1, 2], [3, 1], [2, 4], [2, 3]]], 2, "Example 1"], + [[[2, 5], [[3, 4], [2, 3], [1, 5], [2, 5]]], 3, "Example 2"], + [[[1, 1], [[2, 2], [3, 3], [4, 4]]], -1, "Example 3"], + [[[0, 0], [[0, 1], [1, 0], [0, 2], [2, 0]]], 0, "Example 4"], + [[[5, 5], [[5, 6], [6, 5], [5, 4], [4, 5]]], 0, "Example 5"], +]; + +sub nearest_valid_point +{ + my $x = $_[0]->[0]->[0]; + my $y = $_[0]->[0]->[1]; + my $points = $_[0]->[1]; + + my $idx = -1; + my $i = -1; + my $min_dist; + for my $p (@$points) { + $i++; + if ($p->[0] == $x || $p->[1] == $y) { + my $d = abs($x - $p->[0]) + abs($y - $p->[1]); + if (!defined $min_dist || $d < $min_dist) { + $min_dist = $d; + $idx = $i; + } + } + } + return $idx; +} + +for (@$cases) { + is(nearest_valid_point($_->[0]), $_->[1], $_->[2]); +} +done_testing(); + +exit 0; diff --git a/challenge-334/peter-meszaros/tcl/ch-1.tcl b/challenge-334/peter-meszaros/tcl/ch-1.tcl new file mode 100755 index 0000000000..4afac6d6cd --- /dev/null +++ b/challenge-334/peter-meszaros/tcl/ch-1.tcl @@ -0,0 +1,84 @@ +#!/usr/bin/env tclsh +# +# Task 1: Range Sum +# +# Submitted by: Mohammad Sajid Anwar +# +# You are given a list integers and pair of indices.. +# +# Write a script to return the sum of integers between the given indices +# (inclusive). +# +# Example 1 +# +# Input: @ints = (-2, 0, 3, -5, 2, -1), $x = 0, $y = 2 +# Output: 1 +# +# Elements between indices (0, 2) => (-2, 0, 3) +# Range Sum: (-2) + 0 + 3 => 1 +# +# Example 2 +# +# Input: @ints = (1, -2, 3, -4, 5), $x = 1, $y = 3 +# Output: -3 +# +# Elements between indices (1, 3) => (-2, 3, -4) +# Range Sum: (-2) + 3 + (-4) => -3 +# +# Example 3 +# +# Input: @ints = (1, 0, 2, -1, 3), $x = 3, $y = 4 +# Output: 2 +# +# Elements between indices (3, 4) => (-1, 3) +# Range Sum: (-1) + 3 => 2 +# +# Example 4 +# +# Input: @ints = (-5, 4, -3, 2, -1, 0), $x = 0, $y = 3 +# Output: -2 +# +# Elements between indices (0, 3) => (-5, 4, -3, 2) +# Range Sum: (-5) + 4 + (-3) + 2 => -2 +# +# Example 5 +# +# Input: @ints = (-1, 0, 2, -3, -2, 1), $x = 0, $y = 2 +# Output: 1 +# +# Elements between indices (0, 2) => (-1, 0, 2) +# Range Sum: (-1) + 0 + 2 => 1 +# + + +package require tcltest + +set cases { + {{{-2 0 3 -5 2 -1} {0 2}} 1 "Example 1"} + {{{ 1 -2 3 -4 5} {1 3}} -3 "Example 2"} + {{{ 1 0 2 -1 3} {3 4}} 2 "Example 3"} + {{{-5 4 -3 2 -1 0} {0 3}} -2 "Example 4"} + {{{-1 0 2 -3 -2 1} {0 2}} 1 "Example 5"} +} + +proc range_sum {p} { + set ints [lindex $p 0] + set x [lindex [lindex $p 1] 0] + set y [lindex [lindex $p 1] 1] + + set sum 0 + for {set i $x} {$i <= $y} {incr i} { + set sum [expr $sum + [lindex $ints $i]] + } + return $sum +} + +tcltest::configure -verbose {pass} +foreach case $cases { + tcltest::test [lindex $case 2] {} { + range_sum [lindex $case 0] + } [lindex $case 1] +} + +exit 0 + diff --git a/challenge-334/peter-meszaros/tcl/ch-2.tcl b/challenge-334/peter-meszaros/tcl/ch-2.tcl new file mode 100755 index 0000000000..c05a0c53d1 --- /dev/null +++ b/challenge-334/peter-meszaros/tcl/ch-2.tcl @@ -0,0 +1,125 @@ +#!/usr/bin/env tclsh +# +# Task 2: Nearest Valid Point +# +# Submitted by: Mohammad Sajid Anwar +# +# You are given current location as two integers: x and y. You are also given a +# list of points on the grid. +# +# A point is considered valid if it shares either the same x-coordinate or the +# same y-coordinate as the current location. +# +# Write a script to return the index of the valid point that has the smallest +# Manhattan distance to the current location. If multiple valid points are tied +# for the smallest distance, return the one with the lowest index. If no valid +# points exist, return -1. +# +# The Manhattan distance between two points (x1, y1) and (x2, y2) is calculated +# as: |x1 - x2| + |y1 - y2| +# +# Example 1 +# +# Input: $x = 3, $y = 4, @points ([1, 2], [3, 1], [2, 4], [2, 3]) +# Output: 2 +# +# Valid points: [3, 1] (same x), [2, 4] (same y) +# +# Manhattan distances: +# [3, 1] => |3-3| + |4-1| = 3 +# [2, 4] => |3-2| + |4-4| = 1 +# +# Closest valid point is [2, 4] at index 2. +# +# Example 2 +# +# Input: $x = 2, $y = 5, @points ([3, 4], [2, 3], [1, 5], [2, 5]) +# Output: 3 +# +# Valid points: [2, 3], [1, 5], [2, 5] +# +# Manhattan distances: +# [2, 3] => 2 +# [1, 5] => 1 +# [2, 5] => 0 +# +# Closest valid point is [2, 5] at index 3. +# +# Example 3 +# +# Input: $x = 1, $y = 1, @points ([2, 2], [3, 3], [4, 4]) +# Output: -1 +# +# No point shares x or y with (1, 1). +# +# Example 4 +# +# Input: $x = 0, $y = 0, @points ([0, 1], [1, 0], [0, 2], [2, 0]) +# Output: 0 +# +# Valid points: all of them +# +# Manhattan distances: +# [0, 1] => 1 +# [1, 0] => 1 +# [0, 2] => 2 +# [2, 0] => 2 +# +# Tie between index 0 and 1, pick the smaller index: 0 +# +# Example 5 +# +# Input: $x = 5, $y = 5, @points ([5, 6], [6, 5], [5, 4], [4, 5]) +# Output: 0 +# +# Valid points: all of them +# [5, 6] => 1 +# [6, 5] => 1 +# [5, 4] => 1 +# [4, 5] => 1 +# +# All tie, return the one with the lowest index: 0 +# + +package require tcltest + +set cases { + {{{3 4} {{1 2} {3 1} {2 4} {2 3}}} 2 "Example 1"} + {{{2 5} {{3 4} {2 3} {1 5} {2 5}}} 3 "Example 2"} + {{{1 1} {{2 2} {3 3} {4 4}}} -1 "Example 3"} + {{{0 0} {{0 1} {1 0} {0 2} {2 0}}} 0 "Example 4"} + {{{5 5} {{5 6} {6 5} {5 4} {4 5}}} 0 "Example 5"} +} + +proc nearest_valid_point {p} { + set x [lindex [lindex $p 0] 0] + set y [lindex [lindex $p 0] 1] + set points [lindex $p 1] + + set idx -1 + set i -1 + set min_dist {} + + foreach point $points { + incr i + if {[lindex $point 0] == $x || [lindex $point 1] == $y} { + set d [expr {abs($x - [lindex $point 0]) + abs($y - [lindex $point 1])}] + if {$min_dist eq "" || $d < $min_dist} { + set min_dist $d + set idx $i + } + } + } + + return $idx +} + +tcltest::configure -verbose {pass} +foreach case $cases { + tcltest::test [lindex $case 2] {} { + nearest_valid_point [lindex $case 0] + } [lindex $case 1] +} + +exit 0 + |