Cody

# Problem 2244. Compute hamming distance between two binary vectors represented using lists of 1-byte numbers

Solution 1892646

Submitted on 6 Aug 2019
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   Fail
u = 0; v = 0; y_correct = 0; assert(isequal(vHamming(u, v),y_correct))

Error in solution: Line: 5 Column: 1 This statement is not inside any function. (It follows the END that terminates the definition of the function "vHamming".)

2   Fail
u = 0; v = 127; y_correct = 7; assert(isequal(vHamming(u, v),y_correct))

Error in solution: Line: 5 Column: 1 This statement is not inside any function. (It follows the END that terminates the definition of the function "vHamming".)

3   Fail
u = [1 0]; v = [1 255]; y_correct = 8; assert(isequal(vHamming(u, v),y_correct))

Error in solution: Line: 5 Column: 1 This statement is not inside any function. (It follows the END that terminates the definition of the function "vHamming".)

4   Fail
u = [0 1]; v = [255 0]; y_correct = 9; assert(isequal(vHamming(u, v),y_correct))

Error in solution: Line: 5 Column: 1 This statement is not inside any function. (It follows the END that terminates the definition of the function "vHamming".)

5   Fail
u = [0 128]; v = [128 0]; y_correct = 2; assert(isequal(vHamming(u, v),y_correct))

Error in solution: Line: 5 Column: 1 This statement is not inside any function. (It follows the END that terminates the definition of the function "vHamming".)