Leetcode 20. Valid Parentheses (but I am losing my mind)

[@ComputerBread]

Hello! Here's a new leetcode video! The end is a bit silly, but it was pretty fun to make! I hesitated between different options to explain the solution to this problem, I am not sure I picked the best one. What do you think? is it ok? Should I just explain the solution without trying to show the thought process?

[@yarburart7242]

I heard from a random old guy that if you imagine JS runs directly on hardware, then in V8 the stack will be implemented in hardware like in CPU. Will this code be faster if we use the stack as in V8 but not as in function calls and is it possible?

[@ComputerBread]

I am not really sure I understand what you mean. But in JavaScript you can't really access the underlying "features" of the V8 engine. But I think it should be possible to write an assembly program to directly manipulate the stack using the stack pointer. (I am probably going to try it & do another video!)

[@tanker7757]

couldnt you count the open brackets and then count the total closed brackets then see if there even seems dumb to check they all close individualy

[@romanvalevin]

Nuh, he did explain, that input like "([)]" should return false, that's the whole point of the problem