A code editor highlights the longest stretch of a line that is made of balanced parentheses. A stretch is balanced when every ( in it is closed by a later ) in it, in the usual nested way, such as (())().
Write longestBalanced(text) that takes a string of only ( and ) and returns the length of its longest balanced substring (a run of neighboring characters). Return 0 if there is none.
Input: text = "(()" Output: 2
The longest balanced stretch is ().
Input: text = ")()())" Output: 4
()() in the middle has length 4.
0 <= text.length <= 3 * 10^4text has only ( and ).Run tries your code on the examples. Submit runs every test, including hidden edge cases, and solves the problem when they all pass.
Ctrl + Enter runs, Ctrl + Shift + Enter submits (⌘ on a Mac).
I'm here to help with #257 Longest Balanced Bracket Stretch. I give hints, never the solution, so you get to solve it yourself. Ask for a hint, select code to ask about it, or press Ask Tuto why on a failing test.
Your first 3 answers need no account. for free to keep asking.