From: Christian Neukirchen <chneukirchen@...>
Date: 2006-10-09T05:36:06+09:00
Subject: Re: [QUIZ] Posix Pangrams (#97)

Ruby Quiz <james@grayproductions.net> writes:

> A pangram is a sentence containing every letter of the alphabet at least once (a
> famous example in English being "the quick brown fox jumps over the lazy dog").
> For maximum style points a pangram should read smoothly, and have both as few
> repeated letters as possible (ideally zero), and as few words as possible.
>
> This quiz extends the idea to the posix utilities[1] - write a program to find
> pangrammatic collections of posix utilities that (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.

Who has a better solution than these?

"awk chgrp df jobs lex mv tty uniq zcat"
"awk chgrp df join lex mv tty qsub zcat"

I think these are optimal for both (1) and (2).
-- 
Christian Neukirchen  <chneukirchen@gmail.com>  http://chneukirchen.org