C[omp]ute

From: "andrew cooke" <andrew@...>

Date: Sat, 6 Mar 2004 15:54:12 -0300 (CLST)

This Lisp using (although they don't seem to say so on their web site)
firm has some fun questions - http://www.itasoftware.com/careers/job2.php

(Spoiler ahead)
















For the palindrome question I'd use two tries, each storing the whole
dictionary, one inverted.  Then I'd trace identical paths through both. 
When you exit at a leaf, you start again at the root.  The shortest
palindrome is found when a pair of pointers are at their respective roots
together.

But how would you do it efficiently for the smallest number of words (not
letters)?

Andrew

-- 
  __ _ __ ___  ___| |_____   work web site: http://www.ctio.noao.edu/~andrew
 / _` / _/ _ \/ _ \ / / -_)  personal web site: http://www.acooke.org
 \__,_\__\___/\___/_\_\___|  personal gallery: http://www.acooke.org/pancito


_______________________________________________
compute mailing list
compute@...
https://200.83.153.5/cgi-bin/mailman/listinfo/compute