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

preview_player
Показать описание
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 ? “

Questions Links:

Do provide you feedback in the comments, we are going to make it best collectively.

Connect with me here:

Telegram Group Link: Love Babbar CODE HELP

Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

#DSABusted #LoveBabbar
Рекомендации по теме
Комментарии
Автор

Too much informative blessed to have a teacher like you😇

pranavmahendra
Автор

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

kshitijbajpai
Автор

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

sayankabir
Автор

doosri baar ye sum solve karke maza agya aap ke saath

ShakibAhmad-jgnk
Автор

Teacher ho to Love Babbar bhaiya jaisa

IkramShaikh-ihqe
Автор

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. 😘😘😘

amitkumarsahu
Автор

Thank u bhaiya for consistent again .
we trust u

vijeas
Автор

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

anmolkumar
Автор

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! 💫

mansoorrr
Автор

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

KACodes
Автор

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

harshitchaubey
Автор

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....

prashantbirajdar
Автор

ek number explaination bhaiya mjaa aa gya backtracking me.

artandcraftworld
Автор

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

vortexdeo
Автор

Kya baat hain bhaiya itna jaldi lecture

ankitsaha
Автор

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

unknownuser
Автор

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

samihabanu
Автор

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

vishalgarna
Автор

this detail explaining is very awesome.

arpitsharma
Автор

Bhaiya, plzz complete this course within this month.

AryanKumar-unri