This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [1 0 0 0 0;...
0 1 0 0 0;...
0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1];
B = [0 1 0 0 0;...
0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1;...
1 0 0 0 0];
tf_correct = 0;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
0
s =
5 5
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
|
2 | Pass |
A = [1 1 0 0 0;...
0 1 1 0 0;...
0 0 1 1 0;...
0 0 0 1 1;...
1 0 0 0 1];
B = [0 0 0 0 1;...
1 0 0 0 0;...
0 1 0 0 0;...
0 0 1 0 0;...
0 0 0 1 0];
tf_correct = 0;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
0
s =
5 5
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
|
3 | Pass |
A = [1 1 0 0 1;...
1 1 1 0 0;...
0 1 1 1 0;...
0 0 1 1 1;...
1 0 0 1 1];
B = [0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1;...
1 0 0 0 0;...
0 1 0 0 0];
tf_correct = 0;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
0
s =
5 5
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
|
4 | Pass |
A = [1 1 1 0 1;...
1 1 1 1 0;...
0 1 1 1 1;...
1 0 1 1 1;...
1 1 0 1 1];
B = [0 1 0 0 0;...
1 0 0 0 0;...
0 0 0 0 1;...
0 0 0 1 0;...
0 0 1 0 0];
tf_correct = 1;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
0
s =
5 5
tf =
logical
0
tf =
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
2
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
2
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
2
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
|
5 | Pass |
A = [1 1 0 0 1;...
1 1 1 0 0;...
0 1 1 1 0;...
0 0 1 1 1;...
1 1 0 1 1];
B = [0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1;...
1 0 0 0 0;...
0 1 0 0 0];
tf_correct = 1;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
0
s =
5 5
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
tf =
logical
1
|
657 Solvers
Test if a Number is a Palindrome without using any String Operations
181 Solvers
We love vectorized solutions. Problem 1 : remove the row average.
546 Solvers
1173 Solvers
2036 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!