text: Originally posted by Don Liu: are we supposed to write the program, or just idea?
  import com.coolskill.foundation.io.CFile;
  Originally posted by Joel McNary: BTW, the instructions are unclear -- is the upper left corner 0,0 and lower right N-1, N-1, or is upper left 1,1 and lower right N,N?
  Originally posted by Joel McNary: No clue what you're doing wrong I can't find any common thread among those that it cannot find.
  Originally posted by Joel McNary: Got it. You replaced & lt and & gt with '<'. This meant that you could only find words that ran backwards! Copy, paste, replace things correctly, and try again. [ June 05, 2003: Message edited by: Joel McNary ]
  Originally posted by David Weitzman: Actually I'm probably directing my efforts in the wrong direction, now that I think about it. Judging roughly by output, 10.5 of those seconds were spent in IO and setting up the HashSets. The individual word searches were quite fast. I'll think about that.
  Originally posted by Sonny Pondrom: Jason, So that others don't do what I did, why don't you change the first message from "where N > 0, N <= 100" to "where N >= 0, N < 100" I got the right answers, but my indicies are off.