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 |
%%
h = counter;
assert(isequal(h(), 1))
assert(isequal(h(), 2))
assert(isequal(h(), 3))
assert(isequal(h(), 4))
assert(isequal(h(), 5))
|
2 | Pass |
%%
code = fileread('counter.m');
assert(isempty(strfind(code, 'persistent')));
|
647 Solvers
Count from 0 to N^M in base N.
200 Solvers
Test if a Number is a Palindrome without using any String Operations
157 Solvers
Back to basics 25 - Valid variable names
253 Solvers
Cell Counting: How Many Draws?
254 Solvers