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 = magic(5);
thresh = 4;
[r,c]= find(magic(5) > 4)
out = [r c]
assert(isequal(RCgreaterThan(M, thresh),out))
r =
1
2
4
5
1
2
3
4
5
2
3
4
5
1
2
3
4
1
2
3
5
c =
1
1
1
1
2
2
2
2
2
3
3
3
3
4
4
4
4
5
5
5
5
out =
1 1
2 1
4 1
5 1
1 2
2 2
3 2
4 2
5 2
2 3
3 3
4 3
5 3
1 4
2 4
3 4
4 4
1 5
2 5
3 5
5 5
|
| 2 | Pass |
M = magic(6);
thresh = 2;
[r,c]= find(magic(6) > 2)
out = [r c]
assert(isequal(RCgreaterThan(M, thresh),out))
r =
1
2
3
4
5
6
2
3
4
5
6
1
2
4
5
6
1
2
3
4
5
6
1
2
3
4
5
6
1
2
3
4
5
6
c =
1
1
1
1
1
1
2
2
2
2
2
3
3
3
3
3
4
4
4
4
4
4
5
5
5
5
5
5
6
6
6
6
6
6
out =
1 1
2 1
3 1
4 1
5 1
6 1
2 2
3 2
4 2
5 2
6 2
1 3
2 3
4 3
5 3
6 3
1 4
2 4
3 4
4 4
5 4
6 4
1 5
2 5
3 5
4 5
5 5
6 5
1 6
2 6
3 6
4 6
5 6
6 6
|
Maximum running product for a string of numbers
762 Solvers
Replace NaNs with the number that appears to its left in the row.
1634 Solvers
Remove the two elements next to NaN value
286 Solvers
How many trades represent all the profit?
437 Solvers
265 Solvers