Spiral Traversing A Matrix Solution ( LeetCode #54 ) | FREE DSA Course in JAVA | Lecture 85

It is an interesting question where we have to traverse a matrix in a spiral format.
So the question is, we have to write a program to print the elements of a given 2D array/matrix of size m*n in spiral order.
So for the matrix,
1,2,3,
4,5,6
7,8,9
The output will be 1,2,3,6,9,8,7,4,5.
Let's see how we can come up with an approach to deal with this program and solve it.
Hint - We are again and again moving in a pattern as left to right, top to bottom, right to left, and bottom to top. You have to use this pattern to approach the program.
Subscribe ‪@TAPACADEMY‬
For more information, fill this form: forms.gle/8eiU...
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacad...​

[@user-hx1kp8kr4m]

Excellent Explanation Sir

[@KRajesh-ej7dy]

Sir Excellent Explination

[@Raubritterr222]

sir, I am saying, this is the best explanation of spiral matrix! ...I hope its clear 😉

[@akarshgupta4981]

Great explanation! Thank you soo much.

[@user-bu4rv9od7b]

superb explanation sir.

[@hari7110]

great explanation bro

[@paisastocks8363]

Perfect 💯

[@manoranjankumarjha3776]

class Solution { public List spiralOrder(int[][] matrix) { ArrayListres = new ArrayList(); int top = 0, bottom = matrix.length-1; int left = 0,right = matrix[0].length-1; while(left>> right top are constant for(int i=left;ibottom for(int i = top;i>>left for(int i=right;i>=left;i--) { res.add(matrix[bottom][i]); } bottom--; // bottom---->>>top for(int i = bottom;i>=top;i--) { res.add(matrix[i][left]); } left++; } return res; } }

[@kethavatharyan3255]

Great

[@Arjunsingh-cf7nf]

owsome question

[@saurabhdwivedi7699]

Can anyone please explain me my whole code is same but when i write :- ( result.add(arr[i][right] ); It is showing me error that the type java.util.AbstractList cannot be resolved