This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [1 2 3; 4 5 6];
n = 2;
B_correct = [1 3; 4 6];
assert(isequal(column_removal(A,n),B_correct))
j =
2
j =
3
|
2 | Pass |
A = magic(4);
n = 3;
B = [16 2 13;
5 11 8;
9 7 12;
4 14 1];
B_correct = B;
assert(isequal(column_removal(A,n),B_correct))
j =
2
j =
3
j =
4
|
3 | Pass |
A = 1:10;
n = 7;
B_correct = [1 2 3 4 5 6 8 9 10];
assert(isequal(column_removal(A,n),B_correct))
j =
2
j =
3
j =
4
j =
5
j =
6
j =
7
j =
8
j =
9
j =
10
|
54296 Solvers
2486 Solvers
Sort a list of complex numbers based on far they are from the origin.
4327 Solvers
Return a list sorted by number of occurrences
1504 Solvers
531 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!