Cody

# Problem 111. Find matching parenthesis

Solution 1865845

Submitted on 5 Jul 2019 by danteliujie
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
s = '()'; n = 2; y_correct = 1; assert(isequal(find_matching_paren(s, n),y_correct))

sum = 0 step = -1 t = 1 sum = -1 sum = 0

2   Pass
s = '()()'; n = 3; y_correct = 4; assert(isequal(find_matching_paren(s, n),y_correct))

sum = 0 step = 1 t = 4 sum = 1 sum = 0

3   Pass
s = '(()((a+b))())'; n = 13; y_correct = 1; assert(isequal(find_matching_paren(s, n),y_correct))

sum = 0 step = -1 t = 1 sum = -1 sum = -2 sum = -1 sum = -2 sum = -3 sum = -2 sum = -1 sum = -2 sum = -1 sum = 0

4   Pass
s = '(()((a+b))())'; n = 12; y_correct = 11; assert(isequal(find_matching_paren(s, n),y_correct))

sum = 0 step = -1 t = 1 sum = -1 sum = 0

5   Pass
s = '(()((a+b))())'; n = 10; y_correct = 4; assert(isequal(find_matching_paren(s, n),y_correct))

sum = 0 step = -1 t = 1 sum = -1 sum = -2 sum = -1 sum = 0