Lecture40: Rat in a Maze Problem || C++ Placement Course 2022 

Congratulations To Code Help Family We have successfully completed 40 lectures of DSA 40++ hours fresh content 💥 "In last 56 days from 15 Nov 2021 Mene iss channel se itna kuch shikha he jitna mene apni poori college life me nhi shikha." Thanks to One & Only mr. Love Babbar Sir( Babbar bhaiya❤️ ) .... *Babbar* shirf naam hi nhi kaam bhi bolta he .....💥💥

itne hard que ko itni easy tarike se samjha diya .. mere chote se dimaag me halchal mach gai😂

10 day recursion challenge completed, despite of you being covid positive. This shows how consistent you are, and how you do what you say, whatever situation may come. That's why I #believeinBabbar . Hats off to you, bhaiya. It feels great watching your new video everyday when it comes, with you I am also trying to be consistent. Thank You.

No one can come close to quality and consistency of your content. Thank u bhaiya.

you wont believe, on the start of the lecture i thought to give it a try by myself and I was able to solve it.......can't express my love for you in words finally i can do recursion problems

Best explanation Bhaiya😁. Itne aache se recursion tree kisi ne nahi samjhaya hai. This series is like life saver for me becuz I am currently pursuing electrical engineering but my interests are in BlockChain Development and problem solving. So your videos are not just helping the CSE students. Its reaching and helping to all the students who wants to enter in the software industry and follow their passion.

class Solution{ private: bool isSafe(vector &m,int n,int x,int y,vector visited){ if((x>=0 && x=0 && yreached at destination if(x==n-1 && y==n-1){ ans.push_back(path); return ; } visited[x][y]=1; //down int newx = x+1; int newy = y; if(isSafe(m,n,newx,newy,visited)){ path.push_back('D'); solve(m,n,newx,newy,path,ans,visited); path.pop_back(); } //Left newx = x; newy = y-1; if(isSafe(m,n,newx,newy,visited)){ path.push_back('L'); solve(m,n,newx,newy,path,ans,visited); path.pop_back(); } //Right newx = x; newy = y+1; if(isSafe(m,n,newx,newy,visited)){ path.push_back('R'); solve(m,n,newx,newy,path,ans,visited); path.pop_back(); } //Up newx = x-1; newy = y; if(isSafe(m,n,newx,newy,visited)){ path.push_back('U'); solve(m,n,newx,newy,path,ans,visited); path.pop_back(); } visited[x][y]=0; //backtracking } public: vector findPath(vector &m, int n) { // 0---> not allowed // 1--->allowed vector ans; //not allowed at starting coordinate if(m[0][0]==0){ return ans; } //starting coordinate int srcx =0; int srcy =0; vector visited = m; for(int i=0;i

Truly a great video! I understood the entire concept. You have made me love coding!

yarr bhaiya kya mast consistency hai aapke course ki, maza aa gya🤩🤩 Although me yaha tk pahucha nahi but aapki consistency dekh kar motivate ho jata hu.😊

Kya samjhaya hai bhai maza aa gya, itna ache se jo last mein dry run ki that was much needed.

Samaj gaya bhaiya. Bohat badhiya explanation tha. First time ye problem dekha maine aur usi me samj gaya approach kya hona chahiye. Thank you so much!

Mast Samjhaya aapne bhaiyya. Yes Recursion and BackTRacking bohot Tough lagta ha humko. Bohooot Practice karna hoga. But Explained Exceptionally well!

omg that was a phenomenal explaination , never thought this would be that easy.💥

Who else could have explained in such a way, hats off!!

i watched your video on advanced binary search where you covered questions like roti pratha,painter's partition and aggressive cows.I loved your explanation. It only took me book allocation problem to properly understand,after that i was able solve to all the other questions without looking at their explanations. however,i watched the whole video to make sure i was not missing any important analysis or anything like that.

Awesome explanations bhaiya, 2 years since the series started but still best on youtube💯💯🔥🔥

You are truly doing a great job brother, hats off to your dedication and more power to you ✨✨✨

i am SDE-2 @Global Payments Inc,(TSYS) Noida. Following all your videos in this series. Had started 1 month ago. was able to solve this Problem without seeing your solution based on the concepts developed in the last 9 lectures. Great videos !!!!!!

faad explaination...itni kushi...itni kushi mujhe aaj tak nahi hui... bhaiiya kya samjhaya hai ye, samajh aajane ki kushi me kya kya likhdu me.... Maje aagye bhaiya😁

Best problem solving course ever. Thank you very much I am eternally grateful to you

Thank you, bhaiya! Your consistency motivate me to practice consistently.

A great effort by love bhaiya personally completed the recursion series and it is one of amazing series i had watched for recursion. love bhaiya had explained it in a very base form so that new people can visit anytime and master into recursion. hats off to you crack placement ++ ;

kya hi hawwa bana ke rakha rha logo ne rate in a maze ka !!! bhaiya maza hi agya !! thank you so much !!

smjh aa gya truely appreciated content aaj tk ase codes ko mug up krne ka try krta tha but ab logically bhi smjh aa rhe h thnks a lot for your effort

Never find such video on RU-vid,,,,,, Great explanation bhaiya 💯 Really impressed ❤️

Very Good Explanation! Keep it up👍 Bhaiya❤❤❤ knowledge++; confidence++;

Best recursion series on RU-vid 👍

Lecture video after video on main channel 😱 consistency OP bhaiya ❤️😊 Thank you so much!!

Thanks bhaiya for explaining to us this amazing problem... mja hi aa gya bhaiya ....hats off to you

Brother... Crystal clear explanation 🤍🤍✨✨ World's best explanation to this problem 🧡✨ Thanks a lot Babbar Bhaiya 🧡✨

life saver man. love you bhaiya🥰🥰.hats off to your effort.

Was waiting for this since morning.

Great content bhaiyya. Easily able to understand all concepts. ❤️

loving the content provided by you all for free ....... hats off to you bhaiya

Amazing content bhaiya, Thank you so much. Love from Kolkata.

Consistentency++, thank you Bhaiya for this wonderful series

Present Bhaiya..Thanks for this amazing course

Agya Samajh pura Recursion, AAg lga di bhaiya 🔥🔥🔥

bhai samajh agya finished recursion today everything so crystal clear thankssss a lotttt

Samagh a gya bhaiya Best DSA course in youtube

Lecture 40 attendance. Your consistency motivate us to practice consistently

Your dedication to teach is greater than our dedication to learn❤️🔥

Thanks bro, course it awesome and it was extremely interesting problem 😀😀

just I am coming to your channel then just do like your video because your consistency is my motivation.

well taught bhaiya it clears the Concept "Samajh aagya bhaiya" . I tried my best to grab the concept from other video's but failed . Tnx a lot bhaiya for teaching us literally ur videos helps us a LOT.

It's going very awesome ❤️ Please keep it up❤️

Thank you very much. You are a genius.

Jabardast samjha bhaiya :) Mein bhi infinite loop mein phasa tha, visited array waali trick mast lagi seekhne mein 😊

Your consistency is awesome ..💯💯

2nd view 😎 Great going placement series 🔥 Just like a fire 🔥🔥

Consistency = babbar bhaiya Bhaiya loving your DSA series I'm only following u bcz Babbar Bhaiya hai toh placement mumkin hai

Thank you bhaiya. I made it by myself. I saw this question 3 months back in Sharaddha didi's video. I was very scared of this question . But after following your 10 video series I did It very easily. You have no idea how happy I am. Thank you so much .

i can't believe this but i am able to solve it just by taking the hint of the visited matrix from ur vdo. I was so poor at recursion earlier but ur explanation made the topic easy. thanks bhayya! my best wishes to u.

Best RU-vid Video Of this Topic 🔥🔥

instead of increasing the space complexity by adding a visited array, we could just change the value in original array to 0 for visited blocks and then backtrack it to 1 after all up , down, left and right functions are called

Samajh gaya bhaiya. Thank you

Bhaiya 10 days challenge Completed Thank you so much for such great dsa series :)

Badhiya se samaj aa gya bhaiya♥️

Thank you soo much bhaiya you are my only hope to get a better placement

Love you babbar bhaiya Clear Explanation

Present Bhaiya ji Aaj fir maza aaya Soon everyone will admit this is the BEST DSA COURSE❤❤❤❤❤

Consistancy , explanation 🔥🔥. Don't let the flow to break , bhaiya 😁♥️

Thanks a lot for the wonderful course.I request you to share the python code as well for the topic discussed in the videos.

Bro really it is too good content we found many learning channel but not like this I have suggestion to make series on compitive programming. We need this type of vedio for learning and solving question Make series on solving problems Plzzzzzzzzzzzzzzzzzzzzzzzzzz This type of vedios r not available in youtube specially in hindi

Upasthit guru ji❣

Inspirational consistency babbar sir.

samajh mein aagaya sir...

Keep the Josh HIGH bhaiya !!!🔥🔥 Hum pichli waali videos ko cover up kar rhe hai..to new videos pe "instantly" zyada views nhi aa rhe honge..aap bas Continue rakhiye..iss Flow ko...videos complete karke..placement lagwaana..hamari zimmedaari 🔥⚡💪 Kuch time me hi cover up kar lenge..phir saath hi saath videos dekhenge. #believeinbabbar #EffortMaaro

Present sirji 👍 What an amazing course🙏🙏👍❤️ Hats off to your dedication 🤗🤗❤️

Mai 2 times dekha but bahut axe se samaj aa gaya

I was doing everything right, just stucked in infinite recursions because of 1,1,1... everywhere. Thanks for 8:43 you solved my problem!

crystal clear bhaiya ekdum full thankyou bhaiya

maza aa gaya bhaiya.....Thankyou sooo much !!..🔥🤩🔥

solved this question on my own....just had an error in the code...Thanks for making recursive topic this easy for me

Present bhaiya You are highly consistent

Samj aa gaya hai bhaiya! Marked Attendance!🔥💫

Clear explanation 👏👏

Great Love Babar Bhaiya🥰

samajh me aagaya thank you bhaiya

Consistency++ and bohot aache se samaj aaya bhaiya... Himmat nahi harenge🙌🏻🔥🚀✅

Good and awesome consistency bhaiya 🤝🥰

bhaiya ek numeber explanation 😃😃

Samajh aa gaya bhaiya❤

Love it broo thank you so much❤

Sirf approach dekh ke hi correct solution ban gaya. Aa gai recursion ab.

Best explanation for Rat in a Maze problem

Samaj aa gaya sir.... Thank you so much sir

Samajh aa gaya bhot achhe se

i loved your way of teaching bhaii ❤

Completed This Bhaiya! Samjh agaya! Interesting question tha, spent more than an hour on this haha Thank you so much

Sir you are amazing and I think majority of us liked the content.

Thankyou sir for this awesome lecture

Best DSA course...... thank you for explaining recursion in such an easy way....

Bahiya apke ish course se bahut baccho ka faida hoga bahut maja aaraha hai ish course me

Smaj aa gya bhaiaya mast backtracking kya hoti h samaj aa gya 3-4 problems or kra dijiyei iski toh or maja aa jayei ✔ 😄 PS: maja aa gya++ (quality question)

maja aagaya bhaiya kya smjhaya h aapne jabardast

Samajh ageya bhaiya...2 ghante lag geya better understanding ke liye

good quality content, thanks bhaiya

consistent bhaiya .......Great....!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

Thx Bhai u r teching is so awesome