This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Nice! I learned something from you.
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
%%
a = [0 1 1 0 -1 1 0 1
0 1 1 0 -1 1 0 1
0 1 0 0 -1 1 0 1
1 2 2 1 0 2 1 2];
b = [2 4];
out = matchPattern(a);
assert(isequal(out(:), b(:)))
|
| 2 | Pass |
%%
a = [0 1 2 3 4 5 6 7
1 2 3 4 5 6 7 8
0 2 3 4 5 7 8 0
0 0 2 3 4 5 6 7];
b = [2];
out = matchPattern(a);
assert(isequal(out(:), b(:)))
|
| 3 | Pass |
%%
a = [0 0 2 3 4 5 6 7
1 2 3 4 5 6 7 8
0 2 3 4 5 7 8 0
0 0 2 3 4 5 6 7];
b = [4];
out = matchPattern(a);
assert(isequal(out(:), b(:)))
|
| 4 | Fail |
%%
a = [0 0 2 3 4 5 6 7
1 2 3 4 5 6 7 8
0 2 3 4 5 7 8 0
0 0 12 13 140 150 160 1700];
b = [4];
out = matchPattern(a);
assert(isequal(out(:), b(:)))
Error: Assertion failed.
|
| 5 | Fail |
%%
a = [0 1 1 0
1 2 3 4
1 5 5 3
2 3 4 5
6 7 7 9
-4 -1 -1 -12
5 6 9 10];
b = [3 6];
out = matchPattern(a);
assert(isequal(out(:), b(:)))
Error: Assertion failed.
|
1214 Solvers
Count from 0 to N^M in base N.
199 Solvers
1761 Solvers
Find out missing number from a vector of 9 elements
198 Solvers
Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock.
575 Solvers