[221] XWords issue

Hello,

I got an algorithm that works for this problem but I think there is an issue.

If I understood correctly, all unknown words must exist in the attached files. This includes one letter words, right? Meaning one letter unknown words must be A or I (as the file is now).

Then how about the case in the example itself (see below)? Similar thing happens for test data, in my solution I had to change the file from just the letters A I to any letter A-Z to get it to pass.

_O_PO_#_U_
A#O##Y#A#Y
_I_E#L#Z#E
I###C_Z_E_
_O_S#L#E##
##R#S#G_U_
_U_L_Y###O
U#N#O#S___
A#C#K##_#I <--- Watch the _ here
_I_#_EN_E_

Solution:

COWPOX#JUT
A#O##Y#A#Y
LIKE#L#Z#E
I###COZZES
FOPS#L#E##
##R#S#GRUB
QUALMY###O
U#N#O#SHIV
A#C#K##U#I <--- Why U when the file specifies A or I?
GIE#YENNED

I see, but then that should be stated in the problem, was a lot of headache debugging this especially since the file mentions that one letter words should be A or I.

Saw that a note was included. Thanks, that will surely help someone else.

Indeed one letter words would not be used but still it made some theoretical sense since A or I could be considered valid words (A book, I write).