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))
|
951 Solvers
1051 Solvers
Project Euler: Problem 3, Largest prime factor
379 Solvers
Return unique values without sorting
588 Solvers
302 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!