Cody

Problem 846. Calculate the Hamming distance between two strings

Solution 1028894

Submitted on 24 Oct 2016 by Dan Po
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
s1 = 'Sunday'; s2 = 'Monday'; d_correct = 2; assert(isequal(hamming(s1,s2),d_correct))

d = 2

2   Pass
s1 = 'Cody is not fun?'; s2 = 'Cody is awesome!'; d_correct = 8; assert(isequal(hamming(s1,s2),d_correct))

d = 8

3   Pass
s1 = 'I do not like MATLAB'; s2 = 'I really love MATLAB'; d_correct = 8; assert(isequal(hamming(s1,s2),d_correct))

d = 8

4   Pass
s1 = 'abcdefghijklmnopqrstuvwxyz'; s2 = 'AbcdEfghIjklmnOpqrstUvwxyz'; d_correct = 5; assert(isequal(hamming(s1,s2),d_correct))

d = 5

5   Pass
s1 = '1234567891011121314151617181920'; s2 = '2019181716151413121110987654321'; d_correct = 27; assert(isequal(hamming(s1,s2),d_correct))

d = 27

6   Pass
s1 = 'race car'; s2 = 'rac ecar'; d_correct = 2; assert(isequal(hamming(s1,s2),d_correct))

d = 2

7   Pass
s1 = 'Are these strings identical?'; s2 = 'Are these strings identical?'; d_correct = 0; assert(isequal(hamming(s1,s2),d_correct))

d = 0

8   Pass
s1 = ''; s2 = ''; d_correct = 0; assert(isequal(hamming(s1,s2),d_correct))

d = 0

Suggested Problems

More from this Author44

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!