Problem Solving Skills for LeetCode

#coding #leetcode #python

[aparnachand]

This is so so great that you are putting out shorts! This is the quickest one can revise. You are incredible and innovative.

[abhirama]

These shorts are amazing. Keep them coming! You are helping us all remain mentally alert.

[Joeybamsandmore]

Thank you for these vids neetcode, I had a problem similar to this recently and having watched this video really helped. Thank you for saving YouTube shorts brainrot, I make sure to always watch these videos all the way through when they pop up

[noextrasugar]

I am loving these shorts, and when they’re ones I have done before it’s 😻😻

[javabeanz]

I don't have time to play these games with programming, but I do enjoy the content. I also enjoy code editors that highlight the matching parentheses.

[Lin_The_Cat_]

Good solution :) you essentially just explained the utility of a Push-Down Automaton in a scenario like this without letting the message get obscured to beginners by the heavy-handed jargon that would otherwise naturally come with Theory of Computation concepts like automata.

[n.h.son]

I believe Map[c] would be close_to_open[c]

[pwc]

Very simple and elegant solutions. thank you :o

[bilbo_gamers]

keep a stack of open parentheses. see an opening one, add it to the stack. see a closing one, pop the top off the stack and check if it's the opening counterpart to the closing one you are seeing. if it's not, or if the stack is empty, return False. if you get through the whole string and the stack is empty by the end, return True. if there are still some values on the stack, return false.

[jumpjump-ozpr]

I have seen this problem before, ended up writing array fuckery I didn’t know the data structure yet at the time

[GK-ddci]

For more context, this is Dyck language which can be represented by context-free grammar which can be transformed into push down automata (which might inspire the solution for this problem).

[mervinjarvis]

The code should be changed fromMap[c] to close_to_open[c]
As there is nothing like Map defined in the code. Kindly change it.

[dvilscry]

For the close_to_open dictionary, why couldn’t you have done open to close?

[hassan_codes]

Quick correction: The singular of parentheses is parenthesis, the pronunciations are identical.

[_Danonik_]

Why test 99( where s = "[([]])" )
Output is true?

[sp]

This sounds like George Polya "How to solve it"

[notmidhun]

is there a way to connect with you as i have some doubts regarding data structures and algorithms

[juhanakaarlehto]

I feel like theres a cool recursive solution but I cant come up with it

[WeirdInfoTV]

I would have just gone through each and every parentheses manually

[wanderer]

Or we could split it at (), [], {} for len(s)/2 times. At the end if we have an empty string left then its valid, else invalid. What would be the time complexity for this tho?