Redundant Braces | Stack | Data Structures & Algo

Given a string A denoting an expression. It contains the following operators ’+’, ‘-‘, ‘*’, ‘/’.
Check whether A has redundant braces or not.
Return 1 if A has redundant braces, else return 0.
Github Link for Python Code:- github.com/net...
Follow us on
Playlist of our series-www.youtube.co....
Facebook: / netsetos-751. .
Twitter: / netsetos
LinkedIn: / nets. .
Quora: www.quora.com/....
Instagram: www.instagram.....
#Redundant #Braces #netsetos

[@ManishSharma-wy2py]

Thanks Mam, You are a great Teacher

[@hiteshsharma4395]

Nice explanation

[@prateekkhandelwal1101]

Thnkyou this is an easy approach!

[@vijayvijay-xf6fb]

thanks mam understood

[@techinsight7850]

Thank you! It was the best explained solution

[@shyamtiwari2656]

thanks for such a good explanation

[@gladyouseen8160]

Doesn't work for ((a+b-c)).
It has to output redundant. But your code says not redundant

[@chagataiful]

Great solution!

[@nETSETOStECH]

Thank you!!!

[@aa10259]

this algorithm not working for test case-> (x+y*(a-b+c))

[@omkarsharma8968]

okay (a(-)b) it is reduntant or not will your code work for this test case ?

[@shubhamchourasia2265]

What if I want to remove the redundant brackets?

[@amitsaurabh9948]

Thanks a lot. I thought we cant implement stack without using a class for the same

[@lostinparadification]

You messed up at 8.34 .