Difference between revisions of "Haskell Quiz/Posix Pangrams"

From HaskellWiki
Jump to: navigation, search
Line 12: Line 12:
* [[Haskell Quiz/Posix Pangrams/Solution Burton|Jim]]
* [[Haskell Quiz/Posix Pangrams/Solution Burton|Jim]]
[[Category:Haskell Quiz|Posix Pangrams]]

Revision as of 10:33, 13 January 2007

RubyQuiz #97: Create pangrams (sentences containing every letter of the alphabet at least once) from the names of the Posix Utilities [1]. From the quiz page: "Pangrams should (1) use the fewest utilities and (2) have the minimum number of repeated letters. In either case, break ties on the other criterion; that is, your first solution should also have as few repeated letters as possible, and your second one should use as few utilities as possible." List of the utilities.

[1] http://www.unix.org/version3/apis/cu.html

The Problem