CONTIGUOUS ARRAY | LEETCODE # 525 | PYTHON SOLUTION

In this video we are solving an array based question commonly asked by Amazon (Leetcode # 525: Contiguous Array).
This is a pretty easy question if you've seen the solution pattern before though can be a bit tricky if you haven't. Luckily the solution is quite easy to explain and is only like 15 lines of code so this problem shouldn't trouble you anymore after this!

[@Hoduekim]

I watched three different solution viddeos + leetcode editorial, and this is by far the best explanation. It just made sense right away. Thank you

[@danilob2b2]

That was the best explanation I've seen so far. Thank you!

[@cshivani]

Great content and great channel - good clarity provided, thanks, please continue to add value by adding content.

[@hursantb7957]

I believe seen_at stores the first time it was seen, not the last time it was seen. Right?
you actually mention it at ~8:20

[@Ankit-hs9nb]

708. Insert into a Sorted Circular Linked List python, this one next, please! :)

[@crackfaang]

Will add it to my queue. Thanks for the suppoet

[@subee128]

Thank you very much

[@minhhieple6483]

What software do you use to draw ? Thank you!

[@crackfaang]

Figma, although Excalidraw would also work

[@appcolab]

Thank you for sharing!

[@crackfaang]

Thanks for the kind words and your ongoing support

[@appcolab]

You're most welcome. I will be sharing your videos on LinkedIn, I want to see this channel grow!!