I appreciate that you kept the debuggining process in. Makes me feel better about making mistakes :)
natebland
Thanks for this great solution video. one question, why check if result.length is less than size for every direction change ? Thank you
KW-dsze
You got a subcriber today ! Thanks man !😊
theadtya
Since the matrix is m x n the time and space complexity would be O(mn).
TylerKaihara
Great job! But i didn't understand the last loop. If the bottom after all those previous iterations is now 1 and the top is 1 too, how does that last loop run twice? Because 1 can't be greater than 1 nor 0 can be greater than 1? Could you please, explain?
