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 |
M= [1 2 3; 4 5 6];
n = 2;
N_correct = [1 2 3];
assert(isequal(row_removal(M,n),N_correct))
ans =
1 2 3
|
Find the alphabetic word product
1997 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
367 Solvers
Sum of diagonals elements of a matrix
132 Solvers
59 Solvers