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 |
%%
x = 'to work';
y_correct = 'worked';
assert(isequal(regverb2simplepast(x),y_correct))
|
2 | Pass |
%%
x = 'to push';
y_correct = 'pushed';
assert(isequal(regverb2simplepast(x),y_correct))
|
3 | Pass |
%%
x = 'to use';
y_correct = 'used';
assert(isequal(regverb2simplepast(x),y_correct))
|
4 | Pass |
%%
x = 'to arrive';
y_correct = 'arrived';
assert(isequal(regverb2simplepast(x),y_correct))
|
5 | Pass |
%%
x = 'to stop';
y_correct = 'stopped';
assert(isequal(regverb2simplepast(x),y_correct))
|
6 | Pass |
%%
x = 'to prefer';
y_correct = 'preferred';
assert(isequal(regverb2simplepast(x),y_correct))
|
7 | Pass |
%%
x = 'to discover';
y_correct = 'discovered';
assert(isequal(regverb2simplepast(x),y_correct))
|
8 | Pass |
%%
x = 'to mix';
y_correct = 'mixed';
assert(isequal(regverb2simplepast(x),y_correct))
|
9 | Pass |
%%
x = 'to carry';
y_correct = 'carried';
assert(isequal(regverb2simplepast(x),y_correct))
|
10 | Pass |
%%
x = 'to rely';
y_correct = 'relied';
assert(isequal(regverb2simplepast(x),y_correct))
|
11 | Pass |
%%
x = 'to dry';
y_correct = 'dried';
assert(isequal(regverb2simplepast(x),y_correct))
|
12 | Pass |
%%
x = 'to play';
y_correct = 'played';
assert(isequal(regverb2simplepast(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
357 Solvers
296 Solvers
63 Solvers
112 Solvers