The House of Brackets

CodeChefOpen on judge ↗

An expression consisting of constants $(1, 2, etc.)$, variables $(x, y, etc.)$, operators $(+, -, *, /)$ and brackets is said to be valid if all the operators have two operands and any bracket opened is also closed. Given an expression as input, your task is to check the validity of the expression and if it is valid, find the deepest nesting of brackets and output the number. Otherwise, output $-1

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