Given a string consisting of ()[]{}. Find the length of the longest Balanced Parenthesis in O(N)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3494 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3315 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | Um_nik | 163 |
3 | cry | 162 |
4 | atcoder_official | 159 |
5 | awoo | 157 |
5 | adamant | 157 |
7 | -is-this-fft- | 156 |
8 | nor | 154 |
9 | TheScrasse | 153 |
9 | Dominater069 | 153 |
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/