Cody

# Problem 2640. Find similar sequences

Solution 1880823

Submitted on 22 Jul 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
m = [3 1 5 0 0 3 4 1 5 0 4 2 1 5 0]; srows = [3 1 5 0 0;4 2 1 5 0]; assert(isequal(findsimilar(m),srows))

ans = 1×2 logical array 1 1 ans = 1×2 logical array 0 1

Index in position 1 exceeds array bounds (must not exceed 2). Error in findsimilar (line 24) ismember(t4(i,:),t) Error in Test1 (line 5) assert(isequal(findsimilar(m),srows))

2   Fail
m = [3 1 5 0 0 1 2 5 0 0 1 3 4 1 5 2 1 5 0 0]; srows = [3 1 5 0 0; 2 1 5 0 0]; assert(isequal(findsimilar(m),srows))

ans = 1×2 logical array 0 1

Index in position 1 exceeds array bounds (must not exceed 1). Error in findsimilar (line 24) ismember(t4(i,:),t) Error in Test2 (line 6) assert(isequal(findsimilar(m),srows))

3   Fail
m = [3 1 5 7 0 3 2 5 7 0 3 5 7 2 0 1 5 7 2 0 4 6 7 8 9 4 5 7 8 0 4 5 6 7 8]; srows = [3 1 5 7 0;1 5 7 2 0;4 6 7 8 9;4 5 7 8 0]; assert(isequal(findsimilar(m),srows))

ans = 1×2 logical array 1 0 ans = 1×2 logical array 0 1

Index in position 1 exceeds array bounds (must not exceed 2). Error in findsimilar (line 24) ismember(t4(i,:),t) Error in Test3 (line 9) assert(isequal(findsimilar(m),srows))

4   Fail
m = [3 1 5 0 0 3 1 6 0 0 3 2 6 0 0 2 1 5 6 0]; srows = m; assert(isequal(findsimilar(m), srows))

ans = 1×2 logical array 1 0

Index in position 1 exceeds array bounds (must not exceed 1). Error in findsimilar (line 24) ismember(t4(i,:),t) Error in Test4 (line 6) assert(isequal(findsimilar(m), srows))