Friday·20·January·2006
Garth’s test
sort
Sort these:( [2005,6],[2005,8],[2004,2],[2002,12] )
(note: a good second question might be: what sort algorithm does Perl
use and what alternatives are there)
iterator
write a sub that returns a closure, that when invoked, returns the successive elements of a passed-in array.
Filed under:
Perl Software Design Blog » competency-tests » sixapart »
garth
// show without comments // write a comment // Trackback URL
// show without comments // write a comment // Trackback URL
Artur’s test
The monk climbs the mountain from 6am to 6pm. And the next day while he is descending from 6am to 6pm, a priest climbs. The priest gets to the top at 6pm, which is the same time that the monk gets to the bottom.
Is there a time that they are ever at the same height?
I solved this equationally at shopzilla somehow. I solved it
graphically at shopzilla. The next day, I realized, that the picture
of someone going down the other side was a red herring: if I had only
reflected the downward trip on the upward trip, I would have noticed
that they would cross paths!
Filed under:
Perl Software Design Blog » competency-tests » sixapart »
artur
// show without comments // write a comment // Trackback URL
// show without comments // write a comment // Trackback URL
Terrence Brannon
Matthew Sisk
