Given a string consisting of ()[]{}. Find the length of the longest Balanced Parenthesis in O(N)
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Given a string consisting of ()[]{}. Find the length of the longest Balanced Parenthesis in O(N)
Name |
---|
One way to do it is count all the closing and opening parenthesis for each parenthesis and sum up the minimum of opening and closing parenthesis for a given parenthesis.
Edit- Ohk so this case is only valid if the opening comes before the closing one so its not a good solution. It can be done via dp maybe not sure
It's gonna be fine, because string like "))((" is also Balanced Parenthesis
It's just abount counting brackets
Ohhk Thanx I didnt know the conditions.
Here is a similar problem
https://csacademy.com/contest/interview-archive/task/longest-parenthesised-substring/