# Hamming Distance between two strings

You are given two strings of equal length, you have to find the Hamming Distance between these string.
Where the Hamming distance between two strings of equal length is the number of positions at which the corresponding character are different.

Examples:

```Input : str1[] = "geeksforgeeks", str2[] = "geeksandgeeks"
Output : 3
Explanation : The corresponding character mismatch are highlighted.
"geeksforgeeks" and "geeksandgeeks"

Input : str1[] = "1011101", str2[] = "1001001"
Output : 2
Explanation : The corresponding character mismatch are highlighted.
"1011101" and "1001001"
```

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

This problem can be solved with a simple approach in which we traverse the strings and count the mismatch at corresponding position. Extended form of this problem is edit distance.

Algorithm :

```int hammingDist(char str1[], char str2[])
{
int i = 0, count = 0;
while(str1[i]!='\0')
{
if (str1[i] != str2[i])
count++;
i++;
}
return count;
}
```

Below is the implementation of two strings.

## C++

 `// C++ program to find hamming distance b/w  ` `// two string ` `#include ` `using` `namespace` `std; ` ` `  `// function to calculate Hamming distance ` `int` `hammingDist(``char` `*str1, ``char` `*str2) ` `{ ` `    ``int` `i = 0, count = 0; ` `    ``while` `(str1[i] != ``'\0'``) ` `    ``{ ` `        ``if` `(str1[i] != str2[i]) ` `            ``count++; ` `        ``i++; ` `    ``} ` `    ``return` `count; ` `} ` ` `  `// driver code ` `int` `main() ` `{ ` `    ``char` `str1[] = ``"geekspractice"``; ` `    ``char` `str2[] = ``"nerdspractise"``; ` ` `  `    ``// function call ` `    ``cout << hammingDist (str1, str2); ` ` `  `    ``return` `0; ` `}  `

## Java

 `// Java program to find hamming distance ` `// b/w two string ` `class` `GFG ` `{ ` `// function to calculate Hamming distance ` `static` `int` `hammingDist(String str1, String str2) ` `{ ` `    ``int` `i = ``0``, count = ``0``; ` `    ``while` `(i < str1.length()) ` `    ``{ ` `        ``if` `(str1.charAt(i) != str2.charAt(i)) ` `            ``count++; ` `        ``i++; ` `    ``} ` `    ``return` `count; ` `}  ` ` `  `// Driver code  ` `public` `static` `void` `main (String[] args) ` `{ ` `    ``String str1 = ``"geekspractice"``; ` `    ``String str2 = ``"nerdspractise"``; ` ` `  `    ``// function call ` `    ``System.out.println(hammingDist (str1, str2)); ` `} ` `} ` ` `  `// This code is contributed by Anant Agarwal. `

## C#

 `// C# program to find hamming  ` `// distance b/w two string ` `using` `System; ` ` `  `class` `GFG { ` `     `  `// function to calculate  ` `// Hamming distance ` `static` `int` `hammingDist(String str1,  ` `                       ``String str2) ` `{ ` `    ``int` `i = 0, count = 0; ` `    ``while` `(i < str1.Length) ` `    ``{ ` `        ``if` `(str1[i] != str2[i]) ` `            ``count++; ` `        ``i++; ` `    ``} ` `    ``return` `count; ` `}  ` ` `  `// Driver code  ` `public` `static` `void` `Main () ` `{ ` `    ``String str1 = ``"geekspractice"``; ` `    ``String str2 = ``"nerdspractise"``; ` ` `  `    ``// function call ` `    ``Console.Write(hammingDist(str1, str2)); ` `} ` `} ` ` `  `// This code is contributed by nitin mittal `

## PHP

 ` `

Output:

```4
```

Time complexity : O(n)

Note : For Hamming distance of two binary numbers, we can simply return count of set bits in XOR of two numbers.

My Personal Notes arrow_drop_up

Improved By : nitin mittal

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.