Hello --

Coding Challenge 0002 (my numbering scheme :-) has been posted to
<http://www.rubygarden.org/ruby?CodingChallenge0002>.

As with 0001, this challenge comes with unit tests and an
unimplemented method.  The basic idea of this challenge is:  write a
method which takes two arguments: an array of items, and an
array-of-arrays of items, and determines whether or not a one-to-one
correspondence can be established, so that every item in the first
array can be found in one of the arrays in the array-of-arrays:

This would return true:

   [1,2,3]
   [ [1,11,111], [0,3,2], [2,4,6] ]

This would return false:

   [1,2,3]
   [ [1,11,111], [0,3,2], [4,6,8] ]

(because 2 and 3 aren't allowed to correspond to the same array).

More details on the site -- enjoy.


David

-- 
David Alan Black
home: dblack / candle.superlink.net
work: blackdav / shu.edu
Web:  http://pirate.shu.edu/~blackdav