Baseball Game - Leetcode 682 - Python

[@whosBeanie]

Hey man I commented a while back when you walked around Seattle talking about your channel and working at google, and I had talked about me interviewing at a few companies including Amazon and I just wanted to let you know I just finished my first week at Amazon and your videos were my favorite resource for LC questions. Thanks man for all you do❤️

[@NeetCode]

That's so great to hear!!! Congrats and good luck :)

[@AndreiSokolov-k7j]

@@kenbarlow9023and do you on the other side now?

[@smaa01]

Thanks

[@NeetCode]

Thank you so much!!

[@amangaur4231]

How r u so much clear in explaining things man :| just love ur videos

[@johnj171]

really man you are the GodFather of the coding community love you!!! you are great

[@numberonep5404]

easy prbs are here to boost our ego enough to confront hard prbs xd

[@versatile7713]

I like ur way of explanation man ❤ 👏💯✨

[@hdot2613]

I have essentially the same code but I would have referred to it as using a "dynamic array" in conversation as their implementation is identical in python. Is it wrong to call this a Dynamic Array in an interview or is it best to specify that i'm implementing a Stack? If so, when should I use a Stack vs Dynamic Array

[@rhosymedra6628]

I agree, really weird to call it a baseball game! Great explanation as always.

[@sanooosai]

thank you

[@GaetanoBarreca]

Thanks!

[@viggicodes]

using switch case which was introduced in python 3.10 class Solution: def calPoints(self, operations: List[str]) -> int: stack = [] for o in operations: match o: case '+': stack.append(stack[-1] + stack[-2]) case 'D': stack.append(stack[-1]*2) case 'C': stack.pop() case _: stack.append(int(o)) return sum(stack)

[@abdulraheemsiddiqui9536]

If you store sum variable as well, you would not have to sum again at the end so TC would be O(N) rather than O(2N). I know they are same but still.

[@invaders_must_die6730]

thank you for the great explanation not only for the solution but for the problem itself!

[@jondebosco7478]

Cool

[@rudreshgowda5867]

☕

[@NeetCode]

Thank you so much Rudresh!!!

[@aghilannathan8169]

How is this even a LC question?

[@halahmilksheikh]

This definitely has fizzbuzz vibes to it

[@vineethnc8934]

Please explain Leetcode 321

[@AmazonIntern]

hey neetcode! solid solution. I just wanted to point out that there isn't much error checking here. What if there was a symbol other than the ones provided? It would fail of course because converting a character to an int may ruin the summation. Thus, my solution (provided on leetcode through amazonintern), is much better. If anyone needs help please feel free to reach out. I understand leetcode can be intimidating. But don't worry, we were all there at one point, and I remember being there myself back when I was in the first grade. Back then, baseball problem was quite hard, but by the time I was 7 I had it solved with 0ms runtime. I'm 11 now.

[@r00ty]

isn't it stack[-2] cheating?

[@MrRon-jx9vx]

stack[len(stack)-2] is the same so naah

[@shreyajha1394]

Pin me!! Or i will take your Doughnut...