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.
#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.....
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.
Simulation approach is more intuitive and clean if you uderstand direction co-ordinate. Direction co-ordinate help you solve many other matrix problems easily.
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
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
bhie bhut kadak smja bas tumhi bas last ka spiral ki diagram smaj lo lotebook mai or dry karo smj jauoge viase usne batya ki firat 2 condiotion cheak ho jati hai bas ek line agar print karni hai first two condition se ho jata hai bas topp++ hotnepar us mai vo cheak lagate hai or bottom ke lieye ek cheak taki bottom to tpo value replaced ho jayegi uske liye matlab ki value print nahi honi chiye. thanks ..like me if you understood
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.
Yes I will be going at my pace, don't want to compromise on quality.
thank you @@takeUforward
@@takeUforwardthank you so much bro❤
True that in 2024 still can't find a better DSA course than this 🫡
#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.....
Understood.
The height of this series is you knowing how the code will be after the dry run..
Thank you Striver
True
UNDERSTOOD!!!!
HAPPY FRIENDSHIP DAY STRIVER
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.
This course is really worth more than any course but still it is free.Thank you so much.
you are providing such an amazing content at free of cost really india needs man like you !🤠
Finally was able to solve this problem with 100% understanding! Thanks a lot.
watch in 1.25 is a myth
true that
Thank You Striver Bhaiya !
Your playlist is really helping me a lot :)
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
we don't need like this...we need quality...take your own time striver...
Unbelievable Explanation!!
So well explained! Understood every bit of it!
Simulation approach is more intuitive and clean if you uderstand direction co-ordinate. Direction co-ordinate help you solve many other matrix problems easily.
Bro, wdym by simulation approach?
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.
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
amazing approach!
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..
Really this is a better to paid course
Thank you striver bhiya
Please add videos related to strings as soon as possible.
edge cases are mat[m][1] and mat[1][n], because of which 2 checks are needed
thanks i was not getting sense of if(left
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!!
Is there any way so that i can like this video more than 1 time ❤❤
great explanation as always!! really clear!! Please continue making these videos.
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 ❤ I do it by two different technique. Approach is same but condition is different
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.
Understood 🙏🏻
Bhai U are an Inspiration kasam se Career wise!
providing these well structured series by you feeling like that giving water to tree thnx by core of heart.
Understood.
This is one of the hardest questions I have come across in a while
And u r also looking hard.😊
@@ce038_divanshsingh3 chill bro wth u saying
Sir please , upload videos as fast as possible. 📤📤📤🕔🕔🕔
No more time remaining for our placement
Are bro, wo bhi toh insan ha ek saath kitna kaam krega
bhai sath me dp series ya graph ya tree series padh sakta hai it also help for your upcoming placements
bro tum wait karoge to nhi hoga khud se karne ka try karo. ek banda akele kitna hi kar lega
@@aman_singh__ 🙌
Very good explaination!! Thanks Striver.
Samaj aa gaya!!
understanding
understood ,thnx for excellent explanation ❤❤❤❤❤❤
I was able to solve this by myself but used one pointer only, this is very easy than my code lmao
Thank you bhaiya, understood
this was good, thank you bhrata :)
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
Thank you striver for great content!!
understood❤
Understood Bhaiya!
UNDERSTOOD as always!
understood! amazing explanation!!
please complete it as soon as possible .
Quality is rare with speed
Yes please do complete fast it will be so much helpful for our upcoming placements please
Understood
Understood,Thanks striver for this amazing video.
Thank you bro. understood clearly.
Another Awesome Lecture Sir............
Understood 😊
Sir Thanks a lot for the excellent explanation 😁
Great explanation as usual. Thank you.
understood
thanks striver understood everything
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
Understood..Very clean explanation!
thank you soo much brother for the wonderful explanation
understood partially 🤔
Understood at one go Thank You Striver
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
Itne aasan se bataya ki aadha dekhke hi pura pta chal gya
lovedd the intuition
Thanks bro !!
In while loop while left
UNDERSTOOD;
Understood amazing explanation as always❤❤
Understood
I have been waiting for this video from Striver anna
❤️ U Anna
Nice explanation!
Understood! Awesome explanation.
you are amazing sir huge respect ...
Techdose has given better answer of this problem
Great Explanation
wonderful explanation
understood👍
thnx
bhie bhut kadak smja bas tumhi bas last ka spiral ki diagram smaj lo lotebook mai or dry karo smj jauoge viase usne batya ki firat 2 condiotion cheak ho jati hai bas ek line agar print karni hai first two condition se ho jata hai bas topp++ hotnepar us mai vo cheak lagate hai or bottom ke lieye ek cheak taki bottom to tpo value replaced ho jayegi uske liye matlab ki value print nahi honi chiye.
thanks ..like me if you understood
Understood, Great explanation.
Understood. Thanks a lot
The way you explain
If there is already a while loop that says top
Understood 😁
Thank you sir❤
Ericsson ???
understood sir thanks a lot
It is very confusing to understand where the right left top and bottom corner lies...I think it is very basic but at the time very confusing also
great job
Thank you Bhaiya
Growing day by day in dsa
thank you so much bhaiya
Understood🔥
Understood thanks 👍🙏
Best approach
understood
please striver came up with string videos
thankyou sir love you so much 🥰
Understood !! 😍😍
Thank You Bhaiya 😊