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 |
x = [1 2 4 2 3 1 2 2 4 5];
t = 3;
y_correct = [1 2 2 3 1 2 2 4 5];
assert(isequal(rev_Concat(x,t),y_correct))
[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.]
[> In unix (line 32)
In rev_Concat (line 2)
In ScoringEngineTestPoint1 (line 4)
In solutionTest (line 3)]
|
2 | Pass |
x = [4 6 3 21 1 -9 0 338];
t = 1;
y_correct = [6 3 21 1 -9 0 338];
assert(isequal(rev_Concat(x,t),y_correct))
[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.]
[> In unix (line 32)
In rev_Concat (line 2)
In ScoringEngineTestPoint2 (line 4)
In solutionTest (line 5)]
|
Project Euler: Problem 5, Smallest multiple
241 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
138 Solvers
313 Solvers
148 Solvers