nice
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = 1;
b = 2;
c_correct = 3;
assert(isequal(add_two_numbers(a,b),c_correct))
|
2 | Pass |
a = 17;
b = 2;
c_correct = 19;
assert(isequal(add_two_numbers(a,b),c_correct))
|
3 | Pass |
a = -5;
b = 2;
c_correct = -3;
assert(isequal(add_two_numbers(a,b),c_correct))
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
4834 Solvers
Implement simple rotation cypher
805 Solvers
204 Solvers
Spot the First Occurrence of 5
304 Solvers