Using TDD approach to solve CodeWars katas.
The solution uses converters for input and output data, to transform letters to numbers and the other way around and a duel decider to solve the problem.
The solution adds each as a separate method. Note: another check would be useful in terms of array having elements, but that is covered by the "contains at least one odd element" check.