EP06 - Python Stack - Balanced Parentheses Checker

#Python #DataStructures #Stacks
Welcome to the Python Stacks tutorial.
Following is the repository of the code used in this episode
github.com/ashwin-pajankar/Py...

[@venkatkrishnan9777]

Super amazing explanation

[@shankarkarunakaran5819]

stack is not defined error

[@yuvrajdarekar3494]

It will not work for nested parenthesis

[@PedroCarneiroJr1971]

Guys, I use the python strings approach. Very simple and effective.

[@swethag040]

Pls share the code

[@PedroCarneiroJr1971]

Hi @@swethag040 I'll try to find it at my computer at home and share it here.

[@PedroCarneiroJr1971]

Hey brother @@swethag040 , I am preparing a video to show my solution. I am newbie to this RUclips production thing so that is taking time to have the nerves to do it, but I promisse the solution is interestingly simpler. As soon as it is ready I'll let you know it here under this comment.

[@YouWillSUffer____]

Sir but if won't work let's say ({) } it is actually balanced still it shows False
it's because we are popping { but char will )

[@rahulmittal116]

Above expression is not balanced..
Type of bracket opened at last should be closed first

[@DATA_MACHINE22]

wow

[@machinelearningtensorflow8382]

Can I do it using dict??

[@aryanraje2770]

Yes you can.
openingparenthesis = '[{('
closingparenthesis = ')}]'
openingList = []
exp = '(){'
pairs = {')':'(', '}':'{',']':'['}
def checkParenthesis(exp):
for i in exp:
if i in openingparenthesis:
openingList.append(i)
elif i in closingparenthesis:
if openingList==[]:
return False
top_char = openingList.pop()
if pairs[i] != top_char:
return False
if openingList== []:
return True
else:
return False
print(checkParenthesis(exp))