This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
wow I don't find the words to comment this solution except who can read that?!!
Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
s = '()'; n = 1;
y_correct = 2;
assert(isequal(find_matching_paren(s, n),y_correct))
Error: You may not use the command(s) str2func in your code
|
2 | Fail |
%%
s = '()'; n = 2;
y_correct = 1;
assert(isequal(find_matching_paren(s, n),y_correct))
Error: You may not use the command(s) str2func in your code
|
3 | Fail |
%%
s = '()()'; n = 3;
y_correct = 4;
assert(isequal(find_matching_paren(s, n),y_correct))
Error: You may not use the command(s) str2func in your code
|
4 | Fail |
%%
s = '(()((a+b))())'; n = 13;
y_correct = 1;
assert(isequal(find_matching_paren(s, n),y_correct))
Error: You may not use the command(s) str2func in your code
|
5 | Fail |
%%
s = '(()((a+b))())'; n = 12;
y_correct = 11;
assert(isequal(find_matching_paren(s, n),y_correct))
Error: You may not use the command(s) str2func in your code
|
6 | Fail |
%%
s = '(()((a+b))())'; n = 10;
y_correct = 4;
assert(isequal(find_matching_paren(s, n),y_correct))
Error: You may not use the command(s) str2func in your code
|
Return a list sorted by number of occurrences
1225 Solvers
522 Solvers
Check to see if a Sudoku Puzzle is Solved
232 Solvers
108 Solvers
197 Solvers