#Free Education For All.. # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India.....

Hi striver, i think you already know but these series will be legacy for future coding students So, i hope you don't rush this series I'm saying this because i am seeing a lot of comments saying to complete it very fast.

Understood. The height of this series is you knowing how the code will be after the dry run.. Thank you Striver

This course is really worth more than any course but still it is free.Thank you so much.

Man you literally are a lifesaver, providing such a one stop destination for all the coding questions required to crack any interview.Thanks, striver for your dedication and hard work towards providing quality content.

you are providing such an amazing content at free of cost really india needs man like you !🤠

UNDERSTOOD!!!! HAPPY FRIENDSHIP DAY STRIVER

Finally was able to solve this problem with 100% understanding! Thanks a lot.

Thank You Striver Bhaiya ! Your playlist is really helping me a lot :)

watch in 1.25 is a myth

So well explained! Understood every bit of it!

Saw several videos on this question. This was the perfect and the easiest one. Hats off to you bhaiya. Thanks for such quality content :)

great content... i know it will be very difficult for you but we need more videos as soon as possible

Unbelievable Explanation!!

unbelievable explanation!!

Understood. Thank you for striving for us and surely we'll also strive to make your channel and the A2Z course be rated as the best in the world.

Really this is a better to paid course Thank you striver bhiya

thank you for providing best content for us. we really love it.

Understood! Wonderful explanation as always, thank you very very much for your effort!!

amazing approach!

Simulation approach is more intuitive and clean if you uderstand direction co-ordinate. Direction co-ordinate help you solve many other matrix problems easily.

Very good explaination!! Thanks Striver.

great explanation as always!! really clear!! Please continue making these videos.

Understood ❤ I do it by two different technique. Approach is same but condition is different

Why there's so much rush in CB, RAJ BHAIYA is a human being too, we have sheet na, we canbdo it on our own pace..

Please add videos related to strings as soon as possible.

your solution is good, but i have another idea, i'm using javascript shift(), pop() and reverse() to get the array element into my answer array, then every time i process a row, i'll transpose the matrix and i will reverse() it if needed, then repeat untill the matrix become empty, and print the answer array. All code is written in a while loop with lambda functions. let ans = [] while(matrix.length != 0){ matrix.shift().forEach(x => ans.push(x)); if(matrix.length == 0) break; matrix = matrix[0].map((_,colIndex) => matrix.map(row => row[colIndex])); matrix.pop().forEach(x => ans.push(x)); if(matrix.length == 0) break; matrix = matrix[0].map((_,colIndex) => matrix.map(row => row[colIndex])); matrix.pop().reverse().forEach(x => ans.push(x)); if(matrix.length == 0) break; matrix = matrix[0].map((_,colIndex) => matrix.map(row => row[colIndex])); matrix.shift().reverse().forEach(x => ans.push(x)); if(matrix.length == 0) break; matrix = matrix[0].map((_,colIndex) => matrix.map(row => row[colIndex])); } // print ans here

Thank you very much for this course learnt a lot and your dedication is on another level you were recording this video on 3 am thanks a lot 🙌🙌

understood ,thnx for excellent explanation ❤❤❤❤❤❤

Hi @takeUforward I did not get the last contraint from your explaination as you are too fast at the end. But I got it. Thanks for the video.

Thank you striver for great content!!

Thank you bhaiya, understood

providing these well structured series by you feeling like that giving water to tree thnx by core of heart.

Bhai U are an Inspiration kasam se Career wise!

edge cases are mat[m][1] and mat[1][n], because of which 2 checks are needed

Is there any way so that i can like this video more than 1 time ❤❤

this was good, thank you bhrata :)

UNDERSTOOD as always!

Understood 🙏🏻

This is one of the hardest questions I have come across in a while

At times i feel by watching your videos that i am just seeing the solution and at the end it just feel like spoon feeding , there is no feeling if growth in myself so i request @takeUforward aka striver to please make a video the correct way to approach a problem and how should be approach to your series and problem . if felt same do give like to ensure the comment reaches out to striver

I was able to solve this by myself but used one pointer only, this is very easy than my code lmao

Understood.

understanding

Samaj aa gaya!!

Understood,Thanks striver for this amazing video.

Understood Bhaiya!

understood! amazing explanation!!

Sir please , upload videos as fast as possible. 📤📤📤🕔🕔🕔 No more time remaining for our placement

Great explanation as usual. Thank you.

Thank you bro. understood clearly.

Understood..Very clean explanation!

thanks striver understood everything

lovedd the intuition

Java Solution : kzfaq.info/get/bejne/mbN4rbqZp7uzfmg.html

Understood at one go Thank You Striver

Another Awesome Lecture Sir............

Sir Thanks a lot for the excellent explanation 😁

thank you soo much brother for the wonderful explanation

understood❤

Understood 😊

Understood! Awesome explanation.

Understood I have been waiting for this video from Striver anna ❤️ U Anna

Understood

Itne aasan se bataya ki aadha dekhke hi pura pta chal gya

Nice explanation!

Understood amazing explanation as always❤❤

understood

you are amazing sir huge respect ...

Great Explanation

I saw at the bottom "last saved on" 3:57 AM 3:58 AM 4:00 AM" orz striver bhaiya, staying awake and recording the lecture at late night

please complete it as soon as possible .

wonderful explanation

Understood, Great explanation.

understood partially 🤔

I Think the last IF condition is irrelevant because by the time the control reaches the last loop, the TOP will be greater than BOTTOM

UNDERSTOOD;

Thanks bro !!

In while loop while left

The way you explain

Understood. Thanks a lot

understood sir thanks a lot

Thank you sir❤

thankyou sir love you so much 🥰

Thank You Bhaiya 😊

Understood🔥

understood👍

thank you so much bhaiya

Thank you Bhaiya

Understood thanks 👍🙏

great job

class Solution { public: vectorans; int n,m; void dfs(int i,int j,vectormatrix,vector&visited){ if(i=n || j=m || visited[i][j]){ return; } visited[i][j]=1; ans.push_back(matrix[i][j]); if(i

Best approach

If there is already a while loop that says top

thnx

Understood !! 😍😍

Understood 😁

Thankyou dada🙏🏻🙏🏻🧡

just amazing !!

Techdose has given better answer of this problem