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 = 1;
b = [1,2];
y_correct = 1;
assert(isequal(existsInVector(a,b),y_correct))
ans =
1
|
2 | Pass |
%%
a = 12;
b = [1,3,4,5,6,7,8,1,2];
y_correct = 0;
assert(isequal(existsInVector(a,b),y_correct))
ans =
0
|
3 | Pass |
%%
a = -1;
b = [1,2];
y_correct = 0;
assert(isequal(existsInVector(a,b),y_correct))
ans =
0
|
14317 Solvers
Return the 3n+1 sequence for n
5199 Solvers
Find a subset that divides the vector into equal halves
289 Solvers
Vectorize the digits of an Integer
235 Solvers
Arrange vector in ascending order
541 Solvers