Personal tools

Haskell Quiz/Posix Pangrams

From HaskellWiki

< Haskell Quiz(Difference between revisions)
Jump to: navigation, search
(rm redundant cat)
 
(One intermediate revision by one user not shown)
Line 1: Line 1:
[[Category:Code]]
+
[[Category:Haskell Quiz|Posix Pangrams]]
   
 
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." [[Haskell Quiz/Posix Pangrams/Posix Utils|List of the utilities]].
 
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." [[Haskell Quiz/Posix Pangrams/Posix Utils|List of the utilities]].

Latest revision as of 10:51, 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

[edit] 1 The Problem

[edit] 2 Solutions