Backtracking - Rat in a Maze | C++ Placement Course | Lecture 18.1

[@bdbrightdiamond]

00:53 stamina OP😂❤️

[@Zartan-XR]

🤣🤣Bade Harami Ho Beta

[@bdbrightdiamond]

@@Zartan-XR 😂😂😂😂

[@cenacr007]

indeed

[@vaneetkapoor427]

😂😂😂😂

[@sparshgupta9900]

Jada sochgya londa😂😂..

[@funland739]

Backtracking : Pahele istamal kare fir vishavas kare 😂👍

[@navya9914]

Hahaha really funny😂😂

[@johnwick-m4m]

LOL

[@jatingupta1866]

its simply means undo

[@aryanrodrigo7574]

i guess Im asking randomly but does someone know a method to get back into an instagram account..? I stupidly lost the password. I would love any tricks you can give me

[@skylerelian2448]

@Aryan Rodrigo instablaster :)

[@a.....9053]

He is only person who had work very hard for indian youth let support him together pls share this video so more youth can utilise sources

[@udaykadam5455]

"only" !!!?

[@a.....9053]

@@udaykadam5455 physics wallah is also best

[@AnkitKumar-nx2tq]

@@a.....9053yes..but aman's content is much more diverse

[@AvikNayak_]

He is not the only one.

[@indraxios]

If you search c++ this is the first thing you'll see No need to share

[@jayeshyadav07]

1:47 👍👍👍 urvi dii op👍👍👍11:32. Watch last 17:50 to 18:27 . You will definitely smile. 👍 Thanks 😊 Aman bhaiya.

[@dipeshsaili4468]

pgle pyaar hogya kya tereko?

[@7_ajinkya]

Wow! It means "leap year" code has a simple backtracking logic! Cool!! I didn't even knew I was using backtracking for so long😂😂😂

[@pradnyeshmate1317]

i don't get what you are saying which leap year code

[@singh_lki]

02:03 Jab neha hi akeli bachi to constraints change kar liye honge rahul ne 😂

[@VC-dm7jp]

Finally learnt how to pass a 2 array without mentioning the number of columns!! And a really good video to understand the concept of backtracking.

[@jaypratap3888]

What happens if there are multiple paths through which rat can reach the destination. I guess it will take the first path and neglect all other paths , Correct me if I am wrong.

[@sourabhchoudhary7289]

Backtracking -- Sab try kro fir sahi chuno!

[@neerajkrishnan8574]

In a nutshell ghadi detergent

[@sourabhchoudhary7289]

@@neerajkrishnan8574 😂

[@kumarakash5219]

@@neerajkrishnan8574 airtel sahi example hoga

[@sushmapandey7145]

Pehle istemaal karein phir vishwaas krein

[@bboynishant5255]

Nhi nhi pehle try kro aur Lage ki red flags hai toh agey padho he mat, wapas bhaago

[@joyboy1088]

Damn, they really are putting out some good stuff !!! I had to refer to gfg and other videos to study these topics for competitive coding, gonna watch them again in case I missed something

[@Callme-DS]

didi aap na pura code likhne ke baad ek baar fir se line by line samjha diya kro kyuki ek saath jaldi samajh me aa jata hai

[@talhashahid3677]

Nice lacture today I understand complete rat in maza problem without any doubt ☺

[@anjulatakashyap6974]

Mam your voice is so sweet, and also your teaching style is awsome😍, thank you so much for provide this type of content in free of cost .

[@aakankshanidhi4989]

yeah her voice is magical

[@muhammadsaifullah3078]

this video really helps me, before that I have watched 3 videos on backtracking This really helps

[@yashsimra6090]

please mam make a seperate video on dynamic memory allocation in detail with example

[@kunalgautam8312]

I recently started DSA for placement and chose this series. I was thinking the problem will be hard, etc. before watching the video. But you explained it very clearly and easily. Thank you!

[@l_am_Ahashan]

Way of explaining Osam ma'am

[@amlansaikia652]

This question was really interesting.

[@rajaryanbiswas5486]

Best explanation ever didi

[@AbhishekSingh-eo6bi]

Me at 11:32 -: Ye Choti Choti khusi har koi nhi deta mere payare ...... In all her video understanding & andar wali khusi ( samjh rahe ho 😜 ) is 💯🔥🤟🏻

[@subhashkumar-rl4nf]

all the content on this channel is correct and ,and meant especilly for placement do shrare the video and encourage her to made lot more video likes this .

[@playpoint5792]

Art : Aman Dhattarwal Artist : Aman Dhattarwal's team Such a good course wasn't possible without DiDi.

[@vibhanshusharma5974]

kabhi samaj nhi aya yeh topic lekin aaj poora clear ho gya thanxs aap sbko best of luck

[@success_hub93]

I don't know why but i am addicted to her voice... Never feel bored 😍

[@aakankshanidhi4989]

same here

[@tanishafre4492]

Ye ladka ketchup se judge kar raha he bhaiiii... I want this level of confidence!!!

[@Saurabh-gg9lv]

question was really amazing

[@rahulPandey-xt2ww]

bhtt achha feel huaa soch k

[@rutvikrana512]

Important Points :- - Same Problem Can Be Solved By Dynamic Programming Because Rat can move only right and down. Read Dynamic Programming From Books If You Are New To It. - Common Syntax Of Any Backtraking code :- bool recur(){ if(){} else(){} ..........Terminating Conditions if( we achieved goal ){ return true; } for( Check every directions ){ old_var = new_var; .........change single point if( recur() ){ return true; } .............check if we are right about this point. new_var = old_var; ..............no this point failed reverse changes and loop continue. } return false; ...........if we cant find any direction to go return false; } - If You Understand Fine and Feel Confident then check Sudoku Solving Problem which is also Backtraking problem. HAPPY LEARNING :)

[@kunal9748]

hey, can you please share some book name related to algorithms

[@rutvikrana512]

@@kunal9748 ... Groking’s algorithm is best for basics, then read from online sources, GFG, totorialpoint, hacker earth, etc.

[@akulathreye8563]

yes , how do i make it so that i can configure the rat to go both up as well as down ? should i just add another condition where ........ if(isSafe(x,y-1)) return true ; and put the sol array = 1 inside the if statement ? similarly inside all the true statements i will update the value of the solution ?

[@rutvikrana512]

@@akulathreye8563 ... yes, use matrix array to Check if Rat has visited a spot or not, if yes you can’t go there if no go there, all possible directions you have to check in loop and in each loop make Recursion. It’s same problem as sudoku solving, but we just have to stop when we find our destination/exit point. We can find shortest path to destination also by not returning true if we find destination, just update minimum distance whenever we get to destination. But if you are going in all direction, then you can’t use dynamic programming. You must use Recursion

[@akulathreye8563]

@@rutvikrana512 Also how come she has not deallocated the memory at the end of the code ? using "delete"?

[@learnwithanuj9466]

This is really great 👍👍

[@mjustboring]

theres a catch here we should also use delete operater before ending of program... to neglect the issue of memory leak...

[@ShivaKumar-qq8qm]

concept cleared in such a good manner waah!

[@saikiran2356]

Really helped me for leet code word search

[@saptorshibairagya970]

Areh wah ❤️👌❤️

[@csea_37_shayoribhowmick53]

Thank you so much ❤

[@jivantoshniwal2261]

Beat explanation

[@harsh9558]

This is really some great quality content!

[@harshitrajshorts0001]

Interviewer be like: paise kitne loge decide Kar le 🤣🤣

[@lowercaseguy3578]

Ur code is beautiful.

[@neelshah789]

Instead of passing whole 2d array as an argument we can just declare it globally

[@akankshaverma5804]

Thankyou so much backtracking really scared me but you made it possible ❤️❤️

[@shivamkumar-qp1jm]

Use BFS or DFS it will help to solve bactracking

[@ETEAMaster15202]

well done upna ma'am

[@sayanraha77]

very nice explanation out here loved it

[@aryanagarwal2071]

Pls deallocate the memory at the end of program, it is a good practice.

[@kunalgulati3358]

Nice video, thanks

[@nishantyadav7461]

Dii op - merko bhi pasnad nhi tatao wale You qre best ❤️

[@suvamgupta2914]

Mast explanation tha, just loved it and Thank You so much for making these videos ❤️

[@bosesj]

1. I think the rat ll go to down and right respectively when increasing 'x' and 'y',, not the other way cuz 'x' denotes the row and 'y' column in 2D array, it its represented as arr[x][y] = {..{..}, {..}..} and, lets add two more direction >>> 2. And the rat may have to go up and left too if needed. BUt don't be so hasty cuz just adding another two calls like 1.if(ratinMaze(arr, x, y-1, n, solArr))//left{...} 2.if(ratinMaze(arr, x-1, y, n, solArr))//up {...} in the function will introduce us with a terrible bug, which ll cause an infinity loop at some point (try to think about it, u ll see when). The only solution is what we do in real life, keeping track of the way we came along so that we don't fell in a 'blind loop' (like in movies, when hero keeps visiting same point 5 6 times before he finally realised that he's lost(but the program wont #lol)). So we need a ifVisited function for that,, and voila! we are ready for any maze with that simple function. the COde >>> bool isVisited(int **solArr, int x, int y) { if(solArr[x][y] == 1)return true; return false; } bool ratinMaze(int **arr, int x, int y, int n, int **solArr) { if(isSafe(arr, x, y, n) && !isVisited(solArr, x, y)) { ........ if(ratinMaze(arr, x, y-1, n, solArr))//left { return true; } if(ratinMaze(arr, x-1, y, n, solArr))//up { return true; } ..... }

[@easycodingwithsumit]

Thankyou so much mam really a very good explaination.

[@raidsraids3647]

thank you so much ,respect

[@hsingh-13]

Now, we have a chance to be the 1st Commentor 😂😂😂😂

[@hsingh-13]

But I m late 😭 😂

[@sahilsawal]

Awesome Ma'am :) 🔥😇👍👌🙏👏✌☺👋😀

[@ranjitkoragoankar]

Thank You So Much

[@mtr2936]

This is the best explanation ever ..... thanku concept cleared

[@johnhammond3605]

Need more detail on int** ...what is dynamic memory in array.... I don't recall this thing being taught in this series

[@anurajsingh8137]

Waiting Bhaiya...Awsome series

[@neetupandey7313]

Majjjee hi aaa gaye lecture ko sunke toh!!! Thank you bhaiya didi and whole team!!!🕺🏽🕺🏽🕺🏽🕺🏽🕺🏽❤️❤️❤️

[@rudra_sanyal1679]

great explanation

[@ramgopalbhajans3982]

Rahul is very lucky guy.

[@bibigulotepbergenova3814]

thank you very much!!

[@nitishsingh3470]

Amazing video very nice explanation

[@aswinbarath]

🔥🔥🔥Verithanam🔥🔥🔥

[@himanshuprem600]

thank you.......

[@saikeerthanchiluka4027]

Thank you mam

[@theBeingralph]

Aman bhaiya ki team is savoir in true sense ❤️

[@akshunair3367]

Thank you guys!

[@Utkrshrma]

rahul stud bhi hai or lucky bhi :')

[@arnikchakraborty1553]

rahul medical ka student hain pakka

[@aadityasharma6855]

@@arnikchakraborty1553 I got hurt.

[@bhavuktomar7935]

didi ek baar dry run karke dikha diya karo plzzzzz.

[@zarakib]

Thanks

[@aneesaziz3611]

thanks bhaiya.

[@PAGADLAHEMANTHItVelTechChennai]

please upload every video with English subtitles

[@shivangisahay3301]

This is amazing , urvi!

[@mjustboring]

Didi aman bhaiya ki toh sab taareef karte hi hai kuch shitty peoples 🤬 ko chhod kar... but aapne kitna mast samajhaya... hats off... 🎩🎩... isse acha koi nhi samjha sakta... (free of cost especially)...

[@kankanachowdhury3353]

The explanation is 🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥

[@minhazrahman4828]

Love from Bangladesh 😊

[@adityagupta9719]

very nice video

[@swisswick5715]

aman bhaiya ka chuha backtracking krte hue chala hi gaya

[@happybro7476]

🤣🤣🤣🤣

[@pratikshyabehera4546]

ratinmaze.cpp: In function 'bool ratinMaze(int**, int, int, int, int**)': ratinmaze.cpp:17:18: error: invalid conversion from 'int' to 'int**' [-fpermissive] 17 | solArr = 1; | ^ | | | int How to solve this?

[@knowledgehub1583]

Thank u thanku bhaiyaaa so much

[@aryanrana9025]

Why we wrote x

[@job_freak]

Superb

[@gauravsinghrathore9000]

One of the best video on Backtracking

[@a.s.graphics8305]

I was scared of backtracking but this video has cleared the concept of backtracking to me , thanks for making these amazing videos.

[@Callme-DS]

didi concept to samjh aa jata hai per jaise aap implement kr rhe ho vaisa implementation apne aap se mai nhi kr pata

[@yashpriyadeepkatta8823]

7:10 backtracking function for rat maze

[@madhavaggarwal173]

microsoft wali didi, please topic ko achhe se samjhao jese isme most of the students ko dynamic memory allocation kai baare mai nhi pata tha so please its my request to take action on this point.. and After that, your content is very helpful for all of us and very relative examples you take to explain which is amazing. Thank you so much to give this level of content.

[@madhavaggarwal173]

and yes this code is not working in my laptop i don't know why and even i checked 5 times for correction and everything is ok.. i share my code which is not working.please if someone try this then correct me through comment.. #include using namespace std; bool issafe(int **arr,int x,int y,int n){ if(xn; int**arr=new int*[n]; for(int i=0;i

[@shivamsingh20]

Backtracking explained very nicely..... this course is highly recommended .....

[@anishchauhan2647]

Aman bhaiya you are great you have done a lot for us thanks 😁😁❣️❣️

[@jiteshmeher6013]

Thanks bhaiya 😀

[@siddhantmaharana3936]

This code seems to fail when we reach x==n-1 OR y==n-1, before reaching the last corner. The code gives a null output for this input {1,0,1,1,1},{1,0,1,0,1},{1,0,1,0,1},{1,0,1,0,1},{1,1,1,0,1} which is an N kind of shape. What is the changes we will have to make in order to work this out? Thank you.

[@abhinavpj1729]

I wrote the code myself😁,I used just 65 lines.. I used looping method😊😊

[@jatinmaheriya2343]

Bro can you send your code? because I wrote code but at the last row all the elements are printed zeros!

[@prabhakumari5883]

@@jatinmaheriya2343 #include using namespace std; bool isSafe(int** arr,int x,int y,int n){ if(xn; int **arr=new int*[n]; for(int i=0;i

[@talhamumtaz2678]

Thanks a lot di, i don't know i am calling you di as an urdu speaker hahahah, your method of teaching is very very good.

[@aakashdabas9490]

Damm! Lucky Rahul !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! :/ Ider tho dhur dhur tak khaet khali h !

[@ayushagarwal016]

Rahul bhai OP .

[@Ramesh-ps7yn]

Thank u bhaiya 😊

[@biswojitamishra8249]

I think she not bhaiya she is behen

[@propeller8825]

Legends already knew rahul and Neha would end up together in the end

[@vasutiwari4187]

question : Rat in a Maze programming : Rat Race hotel: TRIVAGO

[@anantsinghal3180]

Sir web development course kab aayega yeh to batado.....🙏🏻🙏🏻

[@JamilaMurtazaKagalwala]

after 3-4 days !! given update on telegram grp

[@AmanRaj-ux8cw]

Go to compile coding Chanel.. Wha mil jayega ya fir free class start ho rhye hai.. G meet par

[@nitishsingh3470]

Yes when web dev course will come?

[@harshulagarwal1755]

@@nitishsingh3470 3-4 days baad. I think before than 10 December toh aa hee jaayega

[@jalsacentre1040]

I couldn't solve one variation Where total no of parths asked and it is allowed to push boxes aside to vacate path Like . . . B . . . B . . B . => . . . B . . . . . . . . Or push Down

[@MVCS_Theja]

But there is a problem what if there is a solution where the rat has to go up,and if we can add a statement to go up, the if the x=0 we can't check the above becz ther is nothing above

[@jenil151]

Rahul and neha reminds me that it's aman bhaiya's channel 😂