In this video, we will learn about the basics of backtracking and how it is different from other recursion variants. Music I use: www.bensound.com License code: Q1IAPI4RNZSUDBQA
Great video, highly appreciate your return. Your expertise in Graphs, Trees, and Backtracking is invaluable. While Trees might come naturally to you, it's challenging for beginners like us. Your teaching approach encourages us to elevate our thinking. Please cover Trees and Graphs after addressing Backtracking. Your contribution would greatly benefit the community. Thanks!
Mast bhai, tumne jo dp and general dsa problem solving me interest banaya na maja aa gya, ab sare oa clear ho jate hai aasani se to kaafi acha lagta hai, thanks 😊🤗
There are two important primers that tell you whether backtracking can be applied to a problem or not. The first one is, can the complete solution to the problem be built by extending a partial solution one valid candidate at a time or not (considering possible decisions to be made for an element of an array, move in one direction in a grid out of all possible directions, concatenate a char of string.etc). The second one is, do we need to restore the visited status of a node to unvisited after visiting it once or not. If the answer to the first question is yes, move to the second question. if the answer to the second question is yes, backtracking will work. if it's no, the question is probably a dfs based question. Also, if your solution doesn't contain a function f(x) that takes in a partial solution x and tells you whether x can be extended into a complete solution or not, then it's recursive brute force and not backtracking. There's is thin line since backtracking is just optimized brute force.
Dekho.....ye zinda hai (bohot late kr diya aane me aditya bhaiya....wanted to study graphs from you but ab to placements bhi start ho gaye hai humare college me...also, wanted to thank you for something....I remember aapne MCM ke intro (2 years back) me bataya tha ki flipkart MCM based ques puchti hai....aur 3 din pehle mere flipkart OA me MCM ka ques aa gaya and I did it in the first try...all thanks to you
Hello Bhaiya. You've said many a times that you would make a video on your flipkart interview experience telling about all the questions that were asked in different rounds. Please make video on that as well.
Bhai Mujhe ML ata he Likin DSA itna nehi, 1 Sal se try mar raha hoon. Bohot channel follow kiya likin bhai tum sach me Guru Ka Guru Ho.. Milte he khabhi bro ❣️
I am planning to start dynamic programming, i already did recursion playlist but everywhere it is mentioned to do backtracking also before touching dp. Can i do that?
bhaiya plz include these problems Knight Tour Sudoku Remove Invalid Parentheses Word Break Problem using Backtracking Print all Palindromic Partitions of a String Find Shortest Safe Route in a Path with Landmines Partition of Set into K Subsets with Equal Sum Backtracking set-7 Hamiltonian cycle tug-of-war Maximum Possible Number by doing at most K swaps Backtracking set-8 solving crypt arithmetic puzzles Find paths from corner cell to middle cell in maze Arithmetic Expressions
Bhaiya ek doubt tha , wo jo controlled recursion me aap North aur East ko useless bta rhe , wo to tbhi useless hoga jb possible moves 4 hai , agar moves 100 ho toh tb toh East aur North me ja skte hai , and that will lead to a new path . Correct if I'm wrong . Following you since 1st year . Thanks for these videos.
You said when we use call by reference then only it is backtracking so if someone learning backtracking in Java or Python programming languages how they implement it. We can't use call by reference in both the languages.
In Java, when dealing with objects, the reference to the object is passed by value. When implementing backtracking, use objects to represent the state and pass them as parameters. Changes to the object's state within the function affect the original object due to the passed reference value.
Aditya if you have made notes of DSA then please upload them only if you don't have enough time to make yt videos. Your way of teaching DSA concepts is excellent.❤💯💯
King returned to take back his Throne!!!
the throne was never lost.
Itna bhi hype nhi bnana hota bhai
@@saurabhsharma7123 it worth the hype
True af
This man is born to make history in coding ❤❤❤
I learned DP and recursion from you 1 year back. Now working at Microsoft 😄
please guide me
@@user-tk3ls5ec5o just follow his tutorial as it is.
please help me bro
Oh interesting man😊
Please guide us bhaiya
Please make a series on graph after completing backtracking🙏
Great to see you back! 2years ago I started with dsa from your channel and today I’m working as a developer at Walmart. Thank you Aditya. :)
Bro is teaching pass by reference and pass by value meanwhile me who codes in java 😅 . Welcome back DP king 👑
Great video, highly appreciate your return. Your expertise in Graphs, Trees, and Backtracking is invaluable. While Trees might come naturally to you, it's challenging for beginners like us. Your teaching approach encourages us to elevate our thinking. Please cover Trees and Graphs after addressing Backtracking. Your contribution would greatly benefit the community. Thanks!
Aditya Verma , you are Legend, Bhai itna sahi explanation kahi nahi mila , sab ek hi style mein padhatey sab. , Mein yehi sochta tha , kya yeh log boltey rehtey backtrack karna , recursion toh khud backtrack hota.
[ CONTROLLED RECURSION + PASS BY REFERENCE ] 🔥🔥
Just start the playlist and you are done, listen and understand everything. Good stuff brother.
Hi Aditya, much pleased to have you back, your playlists helped very much in cracking the placement.
Bhai tagde ho yrr tum , wahi 3 years pehle wala hi tareeka h, mast padhate ho ekdum, god bless you bro🙌🙌
Mast bhai, tumne jo dp and general dsa problem solving me interest banaya na maja aa gya, ab sare oa clear ho jate hai aasani se to kaafi acha lagta hai, thanks 😊🤗
I learned DP recursion from you and now I am working at Nutanix, Thank you Bhai!!!❤
please help me brO
Awesome explanation. Btw, will it please be possible to increase the frequency of uploading the videos?
Thanks for this series Aditya bhaiyya,
When can we expect this series to get completed?
Tiger Zinda Hai. 🔥🔥🔥
Thankyou Very Much for this video 🙏🏻
There are two important primers that tell you whether backtracking can be applied to a problem or not. The first one is, can the complete solution to the problem be built by extending a partial solution one valid candidate at a time or not (considering possible decisions to be made for an element of an array, move in one direction in a grid out of all possible directions, concatenate a char of string.etc). The second one is, do we need to restore the visited status of a node to unvisited after visiting it once or not. If the answer to the first question is yes, move to the second question. if the answer to the second question is yes, backtracking will work. if it's no, the question is probably a dfs based question. Also, if your solution doesn't contain a function f(x) that takes in a partial solution x and tells you whether x can be extended into a complete solution or not, then it's recursive brute force and not backtracking. There's is thin line since backtracking is just optimized brute force.
Can you rewrite this in simple short sentences please. I think you shared someting important but the comment is too complex to understand.
Finally 🎉, Welcome Back Bro
Dekho.....ye zinda hai (bohot late kr diya aane me aditya bhaiya....wanted to study graphs from you but ab to placements bhi start ho gaye hai humare college me...also, wanted to thank you for something....I remember aapne MCM ke intro (2 years back) me bataya tha ki flipkart MCM based ques puchti hai....aur 3 din pehle mere flipkart OA me MCM ka ques aa gaya and I did it in the first try...all thanks to you
Most underrated or unrecognised channel in whole youtube as compare to bhayya and didi wala channel's.
Sir, please please continue youtube ❤ please sir need a graph playlist
Good to see you again 🎉
Finally Legend is back❤❤
The most awaited sir
Thanks for ur return bro❤ and could you please show the code using ide...
@Aditya Verma, can you please tell me what device do you use to teach? is it an ipad?
The king returned with a bang
legend is back
legend is back!
Legend is back
you are a great teacher.
Pass by reference is what i doscovered by facing problems a lot.
I think sometime we need our states computed to be persistent.
Love to see you again
how to change in the same string if i am using java language use stringbuffer or builder?
If you are here, it means you know how to prepare. Relax, work hard everyone and will get placed!
Hello Bhaiya. You've said many a times that you would make a video on your flipkart interview experience telling about all the questions that were asked in different rounds. Please make video on that as well.
Bhai Mujhe ML ata he Likin DSA itna nehi, 1 Sal se try mar raha hoon.
Bohot channel follow kiya likin bhai tum sach me Guru Ka Guru Ho..
Milte he khabhi bro ❣️
Welcome Back Sirrr!!🤩
Thank you ❤
very nice explained....❤❤❤
Welcome back bro...
wooo woo woo you are back ....😊😊
Videos are nice but would we get notes and codes? We are not able to pay on patreon due to some rbi regulations. Is there other way?
such a humorous video, 😂😂
Best explanation❤
Please make a series on graph as well.. bro❤🙏
I am planning to start dynamic programming, i already did recursion playlist but everywhere it is mentioned to do backtracking also before touching dp. Can i do that?
Pleas make more series on trees and graphs also
Happy Diwali Aaditya Brother ❤
Me to pehli baar visit kar rha huun by that click bait vedio but I'm gonna follow you man. your content is understandable 😂
I love your video sir
Sir you are awesome 👍🏻👍🏻👍🏻👍🏻👍🏻
Array always are by reference , so we need backtracking to undo the change in array.
thank you.
I left DSA after getting a Job
but now He is back ….
ab dobara start karne ka mann kar raha hai ❤❤
The GOD of DP❤❤
true.
Great man u are back 🔙🎉🎉
Abhi kaha job karte ho
i thought woodman was the god of dp.
@@TheNishant30 who woodman?
Please take out more videos.I am waiting
king is back!!!!!
Missing those good old pen spining🥲😆
King is back
Sir plz take new problems which are being asked in interview also along with standard problems...
Welcome back
Welcome Back
If java is always pass by value, what happens in it??? everytime it copies the value and perform operation on newer one?????
Bhai apki prediction kya about chatgpt on jobs of programmers??
IK u cant make a video on it, but plz make a reply to this comment
bro which book(s)/website(s) do you refer to learn dsa?
Can you share your complete notes? from these videos
please make video on median of two sorted array please please please...
Hero is back
Thankes
bhaiya plz include these problems
Knight Tour
Sudoku
Remove Invalid Parentheses
Word Break Problem using Backtracking
Print all Palindromic Partitions of a String
Find Shortest Safe Route in a Path with Landmines
Partition of Set into K Subsets with Equal Sum
Backtracking set-7 Hamiltonian cycle
tug-of-war
Maximum Possible Number by doing at most K swaps
Backtracking set-8 solving crypt arithmetic puzzles
Find paths from corner cell to middle cell in maze
Arithmetic Expressions
sundar likhna hoga :D:D
the only channel i watch for dsa
Bhaiya ek doubt tha , wo jo controlled recursion me aap North aur East ko useless bta rhe , wo to tbhi useless hoga jb possible moves 4 hai , agar moves 100 ho toh tb toh East aur North me ja skte hai , and that will lead to a new path . Correct if I'm wrong .
Following you since 1st year .
Thanks for these videos.
even i think the same
Graph series after this please
Legend
What a confident!
is there a way to get this in English
Welcome vaiya ❤
Bhai ka gala thoda baitha hua hai, Welcome Back❤
🎉plz sliding window complete krdo
Make video series on graph and file handling in c
Print LCS ka qn karke batao usse acchi understanding banegi
Nice
bhai jaldi upload karde puri series please
Bhai please daily vedio upload krnai ka try kro
sir next time when you make a comeback please complete the stack and dp series
bhaiya aap great ho graph bhi padha do esake bad fir jaha jana h aapako chale jana
Please explain rat in a maze problem I don't know the working of backtracking in it
Yes I will cover it in this playlist
Thankss ❤
You said when we use call by reference then only it is backtracking so if someone learning backtracking in Java or Python programming languages how they implement it. We can't use call by reference in both the languages.
In Java, when dealing with objects, the reference to the object is passed by value. When implementing backtracking, use objects to represent the state and pass them as parameters. Changes to the object's state within the function affect the original object due to the passed reference value.
❤
Sir aap graph bhi pdha degiy plz
Aditya if you have made notes of DSA then please upload them only if you don't have enough time to make yt videos. Your way of teaching DSA concepts is excellent.❤💯💯
Array + graph +linkedlist
Bhaiya backtracking ke baad graph padha dena
add rotating pen animation in corner your videos, since you have moved to stylus.
Voice change kaise ho gayi teri ?
" Subscribe if you want a girlfriend" ?? Par mein toh ladki hun 😂.. Thanks for coming back Aditya !🙌
You say backtrack mean pass by reference then why you say, In gfg problem if I pass value then it's will work 100%
Your voice got changed than before.
Feedback: Bhiya piease mic ki quality thoda improve krr lo
Thanks, will try to !
Dev Manus🙏🙏