Recently, Grytczuk, Kordulewski, and Niewiadomski defined an extremal word over an alphabet A to be a word with the property that inserting any letter from A at any position in the word yields a given pattern. In this paper, we determine the number of extremal XY 1 XY 2 X . . . XY t X-avoiding words on a k-letter alphabet. We also derive a lower bound on the shortest possible length of an extremal square-free word on a k-letter alphabet that grows exponentially in k.