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))
|
2 | Pass |
a = 12;
b = [1,3,4,5,6,7,8,1,2];
y_correct = 0;
assert(isequal(existsInVector(a,b),y_correct))
|
3 | Pass |
a = -1;
b = [1,2];
y_correct = 0;
assert(isequal(existsInVector(a,b),y_correct))
|
Sum all integers from 1 to 2^n
8414 Solvers
Return the first and last character of a string
3447 Solvers
Find nearest prime number less than input number
268 Solvers
MATCH THE STRINGS (2 CHAR) very easy
250 Solvers
320 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!