I have found few problems with the implementation of HammingDistance, namely:

• unnecessary conversion from String to byte[],
• I think that this implementation was aiming to handle only Strings containing only 0s and 1s, but this is not checked anywhere.

This PR:

• makes a proper utility class out of HammingDistance in 610def7,
• simplifies logic of some existing tests and adds tests against empty input and input of length 1 in 58f7da3,
• simplifies logic in class HammingDistance, updates naming and changes the behaviour for non-binary strings in 00d54bd,
• removes redundant logging in 32b1243.

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.