We say that position i in k-mers p_{1} … p_{k} and q_{1} … q_{k} is a mismatch if p_{i} ≠ q_{i}. For example, CGAAT and CGGAC have two mismatches. The number of mismatches between strings p and q is called the Hamming distance between these strings and is denoted HammingDistance(p, q).

Hamming Distance Problem

Compute the Hamming distance between two DNA strings.

Given: Two DNA strings.

Return: An integer value representing the Hamming distance.