LeetCode Spiral Matrix Solution Explained - Java

[@dediprakasa2162]

Now I understand where those ifs come from. Thank you!

[@sydneystriker5355]

Same Here. THUMBS UP!

[@atift5465]

I live how you explain so thoroughly and use brute force thats understandable and not too optimal to get! Thanks!!

[@brentleyrandy4950]

you all probably dont give a shit but does anyone know a way to get back into an Instagram account..? I was stupid lost my login password. I would love any tricks you can offer me.

[@kolefabian6264]

@Brentley Randy instablaster :)

[@brentleyrandy4950]

@Kole Fabian I really appreciate your reply. I found the site thru google and im trying it out now. Takes quite some time so I will reply here later with my results.

[@brentleyrandy4950]

@Kole Fabian It worked and I finally got access to my account again. I am so happy! Thanks so much, you really help me out :D

[@kolefabian6264]

@Brentley Randy You are welcome :D

[@jugsma6676]

Of all the videos I watched so far, this one is well explained.

[@dhanpalharikumar6192]

true ;)

[@harinaaraayans3453]

great job dood. keep doing this

[@strawberriesandcream2863]

thanks for helping me understand how to solve this problem!!

[@codingchey]

I dont know anything about coding but the coco powder almonds are really good! Thanks for the suggestion Nick!!

[@PssGameplayER]

Really great video. Helped a lot to understand the problem and look for a solution. I was able to solve it using the approach you showed in rotating the matrix.

[@PssGameplayER]

class Solution { fun spiralOrder(matrix: Array): List { val result = mutableListOf() var l = 0 var r = matrix.first().size - 1 val totalSize = matrix.size * matrix.first().size while (l

[@PssGameplayER]

but looks like your solution is much faster

[@sahilanower9189]

Great.... Thumbs up to the clearity of your explanations!

[@samermazraani9011]

very well explained especially descriptive variable names make it easier

[@devyanigera]

Thanks this is great explanation and variable naming!

[@abisoyelawal9810]

I like how you use descriptive variable names instead of i and j

[@georgechen1124]

Nick is the best!

[@kashafmujeeb3690]

What is the time and space complexity for this solution?

[@flamboyanz]

Good one! It made it very easy! Thank you

[@GuitaristVoyage]

can u explain the if check inside whike loop

[@MichaelSalo]

I attempted to do it in a single loop, with some logic to decide what direction the spiral is moving. It works but took me a while and doesn't perform as well as the above.

[@somewheresomeone3959]

Great way to understand! Thank you!

[@lifeofme3172]

It's a fun problem. Thanks Nick 😊

[@satyamgupta6030]

what a nice explaination thanks a ton brother. please keep making such videos.

[@favrito495]

You are awesome bro.!! Love from India

[@kamalpreetsingh4782]

As always great work sir 👍

[@nathann4291]

great work, what's the time complexity?

[@rodrickedwards2759]

O(N) - N is number of elements the matrix

[@laurawu5146]

Feel much better to solve problems while watching your video

[@li-xuanhong3698]

Awesome explanation ! Thanks

[@TheMsnitish]

It would be nice if you can post the solution in Github.

[@epp5179]

Great video! Thank you so much!!!

[@Zetta_11]

So cool idea! Thank you a lot for your efforts!!!

[@Jackson_Leung]

Great solution! Very intuitive.

[@rahulkhatoliya6814]

Great Explanation ! dude

[@dhruva1221]

better than that in geeksforgeeks(where I had left comment to use self descriptive var names would do well) which was better than that of code school where I disliked the logic & var names

[@dineshkumar-kw1ik]

Can anyone, please explain the time complexity for this algorithm?

[@sauravbharti2709]

That was very understandable.. Thank you

[@guntukaramakrishna]

oh my god.. I am just typing the code continuously after his explanation. It was a nightmare before watching this video. +1 for variable naming. That simply made to write flaw less code.

[@surajtopal9940]

woooow, it is very simple using boundaries

[@ryfarley]

Thanks for this. Also, +1 on chocolate covered almond things.

[@Shishiraithal]

Best explaination..thanx man

[@anirbansarkar6306]

awesome solution

[@HR-pz7ts]

Thanks

[@HR-pz7ts]

I came back to thank you again orignally I was looking for a solution for spiral matrix 2 and your explanation was so good that I solved a different question with the help of your explanation in this video.

[@alammahtab08]

If you don't want to type the code, you can get it from here github.com/eMahtab/spiral-matrix

[@yij9010]

love it!

[@大盗江南]

Gooooood!

[@nileshkhimani9315]

hwo to treaverse this spiral matrix in O(logn) time?

[@arunshinde6487]

A similar and better solution class Solution { public List spiralOrder(int[][] matrix) { List res = new ArrayList(); if(matrix.length == 0 || matrix[0].length == 0) return res; int top = 0; int bottom = matrix.length-1; int left = 0; int right = matrix[0].length-1; while(true){ for(int i = left; i right || top > bottom) break; for(int i = top; i right || top > bottom) break; for(int i = right; i >= left; i--) res.add(matrix[bottom][i]); bottom--; if(left > right || top > bottom) break; for(int i = bottom; i >= top; i--) res.add(matrix[i][left]); left++; if(left > right || top > bottom) break; } return res; } }

[@nileshkhimani9315]

please give a solution in O(logn) time please please