LeetCode 885: Spiral Matrix III - Interview Prep Ep 33

Solution explained:
1. we could use an array of directions to control the moving in four directions, this is a common technique that we could apply in a lot of 2-d matrix problem;
2. every time when moving towards the east or west, we'll increase the length by one;
3. we break out of the while loop when we have filled out all the rows.

⭐ Support my channel and connect with me:

// TOOLS THAT I USE:

// MY FAVORITE BOOKS:

My ENTIRE Programming Equipment and Computer Science Bookshelf:

And make sure you subscribe to my channel!

Your comments/thoughts/questions/advice will be greatly appreciated!

#softwareengineering #leetcode #algorithms #coding #interview #SDE #SWE #SiliconValley #programming #datastructures

[PratyushMajumdar]

Thank you took me a while to understand your explanation but now it's finally clear!!

[vinayakpandey]

Very clear explanation.
thank you for doing such amazing work.

[karthikeyansevarajan]

Good video, but it will be nice if you speak about run-time and space complexity.

[arifsyed]

When we are at i=7, d=0 and len=3
we will be getting out of bound exception because the value will be (0, 6)

[vishwanathveerni]

Thanks a lot man.. it totally makes sense now

[suchitragiri]

Very insightful explanation!
Thank you so much:)

[karthikshetty]

Great method and great explation.. Thank you..

[Whaleshamu]

Very nice explanation. how did you come up with the solution?

[syedmohiuddinh]

please share the time complexity and space comlplexity for this solution here in either comment section or in the description

[syedmohiuddinh]

if you can share us the link to this code.it will be helpful

[neelamgagnani]

here you dropped your crown 👑.. great explanation, but still i'll fail the interview if i was asked this question🥲