Is it possible to define a DFA for the language of words having exactly one double letter?
In general, if you claim to have found a regular expression for the language, you can follow Thompson's algorithm to convert that expression into an NFA and then using subset construction to convert that NFA into a DFA.