Peter and Bracket Matching

CodeChefOpen on judge ↗

Peter and Ivan, being programmers, love brackets. One day Peter challenged Ivan to solve a problem to see whose love is greater. The problem is to efficiently perform the following task. Given a sequence of brackets ‘(‘ and ‘)’ of length N and Q queries. Each of the query is the following form. 1 p x: insert a bracket x at position p. x is either ‘(’ or ‘)’ 2 l r: reverse the bracket sequence f

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