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 | 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 12 13 140 150 160 1700];
b = [4];
out = matchPattern(a);
assert(isequal(out(:), b(:)))
|
5 | Pass |
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(:)))
|
Find state names that end with the letter A
553 Solvers
Make an awesome ramp for a tiny motorcycle stuntman
263 Solvers
We love vectorized solutions. Problem 1 : remove the row average.
385 Solvers
Sum the numbers on the main diagonal
375 Solvers
315 Solvers