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))
|
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))
|
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))
|
Sum all integers from 1 to 2^n
8414 Solvers
Project Euler: Problem 7, Nth prime
521 Solvers
Implement simple rotation cypher
943 Solvers
669 Solvers
1221 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!