Problem 846. Calculate the Hamming distance between two strings
Inspired by a similar Cody problem found here.
Parts of the problem description were taken from http://en.wikipedia.org/wiki/Hamming_distance.
The Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In other words, it is the number of substitutions required to transform one string into another. Given two strings of equal length, compute the Hamming distance.
Example
If
s1 = 'cats' s2 = 'dogs'
then
d = 3
because three substitutions are required to transform s1 into s2.
cats => dats (substitute 'd' for 'c') dats => dots (substitute 'o' for 'a') dots => dogs (substitute 'g' for 't')
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers316
Suggested Problems
-
26132 Solvers
-
Maximum running product for a string of numbers
2077 Solvers
-
Set the array elements whose value is 13 to 0
1343 Solvers
-
271 Solvers
-
Try 1.5.4: Celsius to Fahrenheit
789 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!