Re:Can you solve it? The Greplin programming challenge
by thomie on Sunday October 10, 2010 @05:31AM
(#1776846)
Nice, but don't compute the length of a list if you don't have to.
(not . null) instead of (\x -> length x > 1) is shorter, and works on infinite lists also.
Edit: well, in case you would test for x>0.
Ruby solutions to #1 and #2: http://gist.github.com/617676 http://gist.github.com/617678