Compute the Hamming Distance Between Two Strings solved by 2667

We say that position i in k-mers p₁ … p_k and q₁ … 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.

Sample Dataset

GGGCCGTTGGT
GGACCGTTGAC

Sample Output

3

Extra Datasets

Click for debug datasets