Why iam not getting right output

#1
#2

your logic is slightly incorrect . please look below function

bool areParanthesisBalanced(string expr)

{

stack< char > s;

char x;

// Traversing the Expression

for ( int i = 0; i < expr.length(); i++) {

if (expr[i] == '(' || expr[i] == '[' || expr[i] == '{' ) {

// Push the element in the stack

s.push(expr[i]);

continue ;

}

// IF current current character is not opening

// bracket, then it must be closing. So stack

// cannot be empty at this point.

if (s.empty())

return false ;

switch (expr[i]) {

case ')' :

// Store the top element in a

x = s.top();

s.pop();

if (x == '{' || x == '[' )

return false ;

break ;

case '}' :

// Store the top element in b

x = s.top();

s.pop();

if (x == '(' || x == '[' )

return false ;

break ;

case ']' :

// Store the top element in c

x = s.top();

s.pop();

if (x == '(' || x == '{' )

return false ;

break ;

}

}

// Check Empty Stack

return (s.empty());

}

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.