Lecture 82: Rat in Maze Problem || Backtracking Day 1 || C++ Placement Series

In this Video, we are going to learn about Backtracking in C++ and Questions
There is a lot to learn, Keep in mind “ Mnn bhot karega k chor yrr apne se nahi hoga ya maza nahi aara, Just ask 1 question “ Why I started ? “
[For 20% Discount ] Visit Coding Ninjas: bit.ly/3cfdKTe
Discord Server Link: / discord
Course Flow: whimsical.com/...
Notes Link: drive.google.c...
Slides Link: drive.google.c...
Code Links: github.com/lov...
Questions Links:
Rat in Maze Problem: www.codingninj...
Do provide you feedback in the comments, we are going to make it best collectively.
Connect with me here:
Instagram: / lovebabbar1
Twitter: / lovebabbar3
Telegram Group Link: Love Babbar CODE HELP
telegram.me/lo...
My Editor: www.instagram....
Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.
#DSABusted #LoveBabbar

[@pranavmahendra3423]

Too much informative blessed to have a teacher like you😇

[@kshitijbajpai9264]

Time complexity should be 3^(n^2) and not 4^(n^2) because we will not have a choice to go in direction from where we have come to that cell. Good Explanation!! Nice Series

[@amitkumarsahu4729]

Thank you bhaiya🥰 May God bless you❤ All the dreams come true What you are doing for us is speechless. We cannot thank you by words. 😘😘😘

[@imshivendra]

Bro he is making crores per months Hatsoff yo him. he belongs from a simple middle class family but now he is making crores. His hard work and dedication leads him to get success in Life.

[@thesleepycapy]

Instead of keeping a visited array, we can simply put arr[x][y] = 0 and reset it to one while backtracking

[@modiashish1775]

Bhai to Pata kaise chalega ki wahan 1 Tha ya 0

[@sushantshelte4694]

If it is visited that means it was 1 earlier.

[@shibainu7500]

Nice

[@IkramShaikh-ih6qe]

Teacher ho to Love Babbar bhaiya jaisa ho.....❤❤

[@ShakibAhmad-jg5nk]

doosri baar ye sum solve karke maza agya aap ke saath

[@vijeas4679]

Thank u bhaiya for consistent again . we trust u

[@harshitchaubey8274]

17 March course khatam hone wala tha Ab 17 April bhi nikal gya... Plz complete this course fast bhaiya 🙏

[@anmolkumar01]

bhaiya , i think the visited array should not be passed by reference because the visited node or box of one path can also be used by another path so there should be a unique visited array for each path so that it does not bother another path in case of 1 1 1 1 1 1 1 1 1 suppose i am going DDRR in one path but there will be a path RDLDRR and if lower row is already visited for first path so it would bother second path

[@anshumansharma1069]

bestest way to learn DSA❤️😘😍💐🙏🏻🙇🏻‍♂️

[@Harsh_rai_29]

Video number 90 ❤️🔥

[@UzairKhan-qd3xu]

// optimization of if-if cascade by using loop const vector posDir = {{1, 0}, {0, -1}, {0, 1}, {-1, 0}}; const vector moves = {'D', 'L', 'R', 'U'}; for (int i = 0; i < 4; ++i) { int newX = x + posDir[i].first; int newY = y + posDir[i].second; if (isValidMove(newX, newY, arr, visited, n)) { path.push_back(moves[i]); solve(newX, newY, arr, n, ans, visited, path); path.pop_back(); } }

[@vishalgarna4580]

Great explanation sir 🎉🎉 thanks for all efforts are doing for ours 🙏☺️

[@mansoorrr9167]

Love bhaiyya is an emotion, Sacchi mein bol raha hun itna accha kon padata hein bhai time nikaal ke ❤You will be a mark of my success bhaiyya, thank you soo much! 💫

[@prashantbirajdar9271]

thanks sir this was very easy way to solve the rat in maze problem...backtracking ka funda ekdum jabardast tarike se samaj aya ...love u sirr....

[@KACodes]

Bas bhaiya ....aise hi laate raho badhiya badhiya Let's crack it 😂

[@vortexdeo4545]

Nice, last video me iske baare me soch hi rha tha jab all possible matching words print ho the the. Wapas ake idhar kabhi waps aake udhar

[@mr.himanshu4299]

aaiye apka swagat hai babbar bhai

[@artandcraftworld38]

ek number explaination bhaiya mjaa aa gya backtracking me.

[@rachit_joshi]

Thank You So Much BHRATA SHREE !!!!!!!

[@amishapandey6875]

You explain so well bhaiya!

[@arpitsharma7246]

this detail explaining is very awesome.

[@ankitsaha675]

Kya baat hain bhaiya itna jaldi lecture

[@samihabanu4044]

Keep it up bhaiya I no u wl never let us down consistentcy++++++++++++

[@sahilanand4715]

Inko unicorn banwao yaar. Bahot honest insaan hai bhai apna.

[@adapaavinash28]

homework solution int dr[4]={-1,+1,0,0}; int dc[4]={0,0,-1,+1}; vector dir{'U','D','L','R'}; bool isValid(int r ,int c,int n,vector &vis,vector &m){ if(r>=0 && c>=0 && r

[@iteself_me]

143 ✅completed 👍Liked 3:00

[@jaydwarkadhish959]

Sir amazing video super duper video

[@unknownuser6143]

Great video. With great explanation... thanks babar.

[@theraunak1466]

thank you bhaiya the course is very helpful

[@mohitmail85]

Great explanation, Thank you

[@mohitaggarwal2251]

Amazing❤❤

[@shaileshsathe9779]

Very informative and nicely explained. Is it possible for you to post the Java code also with each video

[@ranudhanotiya9363]

Thank you so much bhaiya for providing good content and for your efforts

[@BornHubisLive]

Thanks a lot ....Bhaiya !!

[@KumarDinesh-zw2vq]

Thank you very much sir!!

[@govindnair3135]

Love you bhaiyya ❤️

[@Anmol-h8z]

we don' t need visted array we can mark that node as 0 when we reach that block

[@ShubhamKumar-rh3dz]

28:06 invalid initialisation jo aa rha solve function me ..wo kaise gya

[@bhupendersingh2604]

good explanation Thanks Babbar.

[@AryanKumar-un1ri]

Bhaiya , plzz complete this course within this month.

[@paras_jain1312]

Complete hua??

[@praash.]

Yes bhai rat in maze problem kara di hai map se apne

[@utsavkumar6048]

bhaiya mst samajh mein aya

[@bite091_jamee7]

present sirji

[@Oroniislam-l6o]

Thanks a lot vaia for consistent

[@dhairya4176]

Thanku bhaiya for this valuable content

[@sahilchhabra2391]

thank you bhaiya, well explained!

[@BhaiRayyanKiDuniya]

ThanQ

[@TechUprise-by-Jyoti]

Thank you bhaiya😇

[@BhaiRayyanKiDuniya]

May God Bless Y

[@muskanpreetkaur5652]

very very nice video..........maza++;

[@ShivamGupta-qh8go]

can we do it using dynamic programming

[@MukeshKumar-fz3sw]

mza ++ , samajh aa gya ++

[@DivyaAgarwal158]

Sir this solution is giving runtime error on gfg

[@KratosProton]

Great explaination

[@063himanshumishra4]

Bhaiya moj kr diii

[@jitendrakumar-vv8ho]

while backtracking how the string is getting emptied can anyone explain?

[@sagnikmodak4178]

thanks sir

[@nishankdeep3084]

thank you

[@akankshapandey8316]

Thanku sir ❤

[@memorybyshubhammanitripath4368]

Maja aaya 😁😁 Code link update kar do 😁😁😁😁😁

[@sakshisingh5664]

What does it mean "vector visited (n, vector(n,0));"

[@sakshisingh5664]

"visited (n, vector(n,0));"

[@sakshisingh5664]

I searched everywhere but I didn't find sufficient solution

[@user-og1qm9ql7j]

Visited is a n-sized vector of n-sized vectors, with each smaller vector that is inside visited, has all its elements = 0. Basically, visited is a matrix of size n x n.

[@BhaiRayyanKiDuniya]

#Peace&&Blessings

[@skchoudhary4122]

🔥🔥🔥

[@focus.placement5589]

thankss bhaiya

[@Mainak908]

at 21:11 is that vector return type declared? I didn't understand at all...pls anyone clarify this

[@Jaga6657]

we are initializing vector (x,y) x represent size ,y represent value

[@mdmesbahurrahman7311]

I can solve codeforces div 2 -> (A) in contest regular, but can not solve B in contest. Now is this effictive for me to avoid solving A and start with problem B in contest ?

[@suyashp]

practice problems in the difficulty range 1000-1300 from problemset and you will improve.

[@The_Shubham_Soni]

Nice

[@shresthkaushik6636]

🙏🙏

[@nishanthedaoo8937]

Hello sir Can you reopen the registration ?

[@keshavgambhir9894]

Present bhaiya

[@anuptewary3016]

Swaad+++❤️

[@mohdkonain6592]

Consistency is back

[@yashzawar7938]

did not understand the syntax of visited array/vector!!

[@smanivesh]

BHAIYAA... CODE GIT PE UPLOAD KR DIJIYE PLEASE!!

[@Profnegi]

hello didi apki placement hui kahi pr??

[@smanivesh]

@@Profnegi haanji ho gyi😃

[@Profnegi]

@@smanivesh on which company? 🥳 and didi pls guide me how I can grab an internship. (Confused++)

[@smanivesh]

@@Profnegi I got placed in PWC as well as Comviva. For internship, you can approach different person from different companies and ask for the process of selection for internship. You can also approach HRs directly.

[@Profnegi]

@@smanivesh thx.. 😇

[@asktostranger8296]

Bahi consistency nahi rukni chaiye 😌🙏

[@prathamesh2906]

Thanks for vidro

[@360-prajwalkandalkar6]

Thay you bro

[@yashsingh7375]

koi please " vector > visited(n, vector(n,0)); " ye wala statement samjha do please

[@subhranilsaha4305]

iska matlab visited matrix main 'n' number of rows hain and har ek row main ek bool vector hain jo 'n' number of zeros se initialized hain. Basically ye isliye likha gya hain taki for loop ka use na karna pare visited matrix ko initialize karne ke liye.

[@RajKumar-vq1nm]

❤️

[@gaming_zoid6159]

Please anyone clear my doubt, Is the provided solution is simple recursion not backtracking?

[@muhammadsuleman8936]

When the recursion unwinds it will remove the last character since its called backtracking

[@RavindraKumar-bw6gi]

Can anyone explain me why we are not removing last character of Path while backtracking😢

[@vamshigudimalla1013]

yeah you are right . we need to remove the char added when we are moving in the direction. this code fails on gfg site. we need to modify the code to remove the char added after recursive call

[@suryapratap2219]

but humne jo path hai vo by refrenvce nhi bheja simpl bheja hai to hur recursive call ke liye ek alag path banta hai aur usmein ussi specific call ke waqt jo path directions hote hn vhi rehte hn to bottom se backtrack karte vaqt unhen nikalne ki kya zaroorat

[@adarshsharma3686]

Approx aur kitne lecture bache honge is coarse me ?

[@whatsnext7778]

40 +

[@Winnerloser12]

60

[@mohitchauhan7514]

😎

[@sauravdhar1696]

I'm in trees but I will start backtracking from today simultaneously

[@praash.]

Can you interested in pair programming?

[@sauravdhar1696]

@@praash. main 8th sem mein hu bhaai 🙂🥲

[@praash.]

@@sauravdhar1696 bhai pair programming krni h sem se kya fark padta h

[@sauravdhar1696]

@@praash. I mean I'm running out of time ...so ab bhaag rha hu bhaai tezi se bas to cover up things I don't think 2 log mein wo speed maintain hoga

[@sauravdhar1696]

@@praash. tum batao kitna padh liya hai ab tak?

[@govindnair3135]

😘😘😘😘😘😘

[@pokigamerop]

last test case :)

[@aniketambat6334]

Understand++

[@someshsangwan5302]

Bhaiya graph or Dp start kr do please jldi se

[@code-beguru]

Couldn't get idea how to implement those 4 conditions with a for loop. Anyone has done this?

[@sourabhbindal774]

Yes here is the code #include bool isSafe(int newx, int newy, vector< vector < bool>>& vis, vector >& arr, int n){ if(newx >=0 && newx < n && newy >= 0 && newy < n && vis[newx][newy] != 1 && arr[newx][newy] == 1){ return true; } return false; } void solve(int x, int y, string path, vector < vector < int >> &arr, vector< vector < bool>>& vis, int n, vector& ans){ //base case if(x == n-1 && y == n-1){ ans.push_back(path); } //4 movement //D L R U vis[x][y] = 1; //4 operations will make array int opx[4], opy[4]; char ch[4]; opx[0] = x+1; opy[0] = y; ch[0] = 'D'; //D opx[1] = x; opy[1] = y-1; ch[1] = 'L'; //L opx[2] = x; opy[2] = y+1; ch[2] = 'R'; //R opx[3] = x-1; opy[3] = y; ch[3] = 'U'; //U for(int i=0 ; i searchMaze(vector < vector < int >> & arr, int n) { // Write your code here. vector ans; vector vis(n, vector(n, false));; string path = ""; if(arr[0][0] == 0){ return ans; } solve(0, 0, path, arr, vis, n, ans); return ans; }

[@iutkarshmehta]

Attendence marked🙏🏻

[@yashji6989]

Abhi TK bahut hard lg rha tha par Ab nhi lgta

[@Oroniislam-l6o]

Consistently ++++++++++++

[@mainaksen5064]

20:00

[@yashwantmishra9109]

Ye wala qs to phele karwaya tha bhaiya Vdo repeat ho gaya

[@arshdeep011]

Ma recursion se sida yaha a geya hu

[@vannamnguyen5074]

i think vid should have subtitle ,tks

[@Ankitnsk178]

UnderStood++

[@praveennemagoudar3442]

// HOME WORK class Solution{ public: string dir = "DLRU"; vector dx{+1,0,0,-1}; vector dy{0,-1,+1,0}; bool isSafe(int x, int y,vector &arr, vector &vis, int size) { if( x>=0 && x=0 && y

[@abhishekgamer6097]

Present