Find maximum depth

CodeChefOpen on judge ↗

Problem Name : Find maximum depth of nested parenthesis in a expression Problem description : Write the 'findMaxDepth' function that takes a string as input. Check whether parenthesis are balanced or not. If parenthesis are unbalanced return -1, otherwise find maximum depth of balanced parenthesis and return maximum depth. Example: Input : “( ((X)) (((Y))) )” Output : 4 Reason : In this

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