too demanding
good job
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
2 | Pass |
n = 2;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
3 | Pass |
n = 28;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
4 | Pass |
n = 453;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
5 | Pass |
n = 17;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
6 | Pass |
n = 16;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
Find the longest sequence of 1's in a binary sequence.
2446 Solvers
Reverse the Words (not letters) of a String
244 Solvers
187 Solvers
243 Solvers
281 Solvers