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 |
A = [ 12 4 7
5 1 4];
B_correct = [ 7 4 12
4 1 5 ];
assert(isequal(swap_ends(A),B_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 swap_ends (line 2)
In ScoringEngineTestPoint1 (line 5)
In solutionTest (line 3)]
|
| 2 | Pass |
A = [ 12 7
5 4];
B_correct = [ 7 12
4 5 ];
assert(isequal(swap_ends(A),B_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 swap_ends (line 2)
In ScoringEngineTestPoint2 (line 5)
In solutionTest (line 5)]
|
| 3 | Pass |
A = [ 1 5 0 2 3 ];
B_correct = [ 3 5 0 2 1 ];
assert(isequal(swap_ends(A),B_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 swap_ends (line 2)
In ScoringEngineTestPoint3 (line 3)
In solutionTest (line 7)]
|
| 4 | Pass |
A = 1;
B_correct = 1;
assert(isequal(swap_ends(A),B_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 swap_ends (line 2)
In ScoringEngineTestPoint4 (line 3)
In solutionTest (line 9)]
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
476 Solvers
186 Solvers
1544 Solvers
164 Solvers
Pernicious Anniversary Problem
641 Solvers