LeetCode #20: Valid Parentheses | Stack Data Structure

preview_player
Показать описание
Step-by-step solution to #LeetCode question 20: Valid Parentheses.
0:00 Problem description
0:44 Strategy guide
1:13 Code walkthrough
4:14 Second example
5:26 Third example

#coding #programming #algorithms
Рекомендации по теме
Комментарии
Автор

best algorithims video on youtube. thank you. please make more. The visualisation of the loop and the explanation is perfect (love the extra examples!). High quality content.

AI_Impact_Zone
Автор

Finally, I understand it with the visual representation. Thank you so much.

mercy
Автор

very nice solution and great explanation, thanks for the video!

iguanamovies
Автор

Amazing!! Thank you so much, please do more of these!! The visualizations makes everything so much easier to understand. :)

FaizYah
Автор

This is the best solution so far that uses stack better and easier to understand. Thank you so much

oluwatosin
Автор

thanks for the moving visuals, i needed it

johtodev
Автор

Thank you for the simple well explained examples!

jamestuttle
Автор

thanks for your help. I understood the algorithm😊

saravanant
Автор

This is a very very tutorial, i hope you continue doing this.

xwizard
Автор

Wow! I'm impressed by the quality of your explanations, please keep doing this leetcode explained problems pls!

joscaz
Автор

Sorry im a bit confused about an edge case. What happens if we have something like this: 

[ '(', ' )', '[', '{', ' }', ' ]' ].

Would this not cause an issue because the stack would be empty by index 1? Thus returning a pre mature negative?

milo
Автор

elif len(stack) ==0 or /, what is this / for ?

johnsharonkumarj
welcome to shbcf.ru