Task 1: "Minimum Sum Path

Given an MxN matrix with non-negative integers, write a script to find
a path from top left to bottom right which minimizes the sum of all
numbers along its path. You can only move either down or right at any
point in time.

Example

Input:

[ 1 2 3 ]
[ 4 5 6 ]
[ 7 8 9 ]

The minimum sum path looks like this:

1->2->3
      |
      6
      |
      9

Thus, your script could output: 21 ( 1 -> 2 -> 3 -> 6 -> 9 )
"

My notes: sounds like fun.


Task 2: "Word Break

You are given a string $S and an array of words @W.

Write a script to find out if $S can be split into sequence of one
or more words as in the given @W.  Print all the words if found
otherwise print 0.

Example 1:

Input:

$S = "perlweeklychallenge"
@W = ("weekly", "challenge", "perl")

Output:

"perl", "weekly", "challenge"

Example 2:

Input:

$S = "perlandraku"
@W = ("python", "ruby", "haskell")

Output:

0 as none matching word found.
"

My notes: sounds like fun.  Nice question.