Parenthesis with Maximum Sum Subarray

CodeChefRating 2435Open on judge ↗

You are given a character parenthesis array and an integer array. You need to find the maximum sum sub-array in the integer array such that the corresponding sub-array in the character array has balanced parenthesis. Formally, a balanced parentheses is subset of { [,],{,},,(,) }∗ defined recursively as follows: - The empty string is balanced parentheses. - If A is balanced parentheses, then so

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI