6.2 Sum Of Subsets Problem - Backtracking

Sum of Subsets problem
PATREON : www.patreon.com/bePatron?u=20...
Courses on Udemy
================
Java Programming
www.udemy.com/course/java-se-...
Data Structures using C and C++
www.udemy.com/course/datastru...
C++ Programming
www.udemy.com/course/cpp-deep...

[@monishpidugu5134]

Excellent sir I slept while my professor was teaching during my online classes but tomorrow I'm having my exam and I am watching your video's it was very helpful

[@worldvieweye]

👍🏻👍🏻

[@srujangurram]

Same bro, hope you scored good in your exam

[@monishpidugu5134]

@@srujangurram yeah bro I scored 80 percent in my sem end examination

[@srujangurram]

@@monishpidugu5134 that's awesome ! we have exam tomorrow. hope i does well too 🤞

[@ingloriousmedia3096]

I read I slept with my professor 🤣

[@manish4275]

Even my professor watches ur videos! If she forgets something we say her video is buffering 😂😂

[@bharamberishikesh508]

My Professor Watches too but shortly explains algorithm 😂

[@anupriyaranjan8966]

You got me at "buffering" 😂😂

[@karamchauhan7860]

@@anupriyaranjan8966 Mam aap yaha 😄😀😄😀😄

[@Randude14]

DEAD

[@ManishKumar-rz9ub]

Possibly you will get the same question in the exam 😂😂

[@ayounghosh9218]

beautifully explained, amazingly clear videography, easily understandable hand writing, simple examples, clear simple English speech so that everyone can understand, slow paced speech so that anyone can grasp the concept, clear audio and the best part is the calm attitude of explanation, just everything that is needed for a perfect explanation, your channel has it.

[@unscripted_india]

Hit like if you have exams tomorrow and are watching this for end semester.

[@Pankajkumar-dy9ef]

yes

[@abhinavsharma8395]

yes bro

[@rishiraj8416]

Hit like i have exam today 😂😂😂😂

[@carlosgallegos1265]

If I watched this as my last resource the day before having an exam, I wouldn't pass anything. It's good to take a first glance, or to break apart a problem and solve it, but not as an academic foundation. Step up your game, don't be lazy.

[@TheRegalstreak]

@@carlosgallegos1265well it depends on person to person. I'm used to studying on the last minute and KZbin videos are my last resort if I don't understand anything from books and Abdul Bari has been like a God to me literally. I wasn't much into algos and I'm really interested to get into this more. The teachers we have are too underpaid and are not as qualified as well as don't have their concepts clear some of the times. Having a community online helps us help one another and get info quickly without looking into 100s of pages lol.

[@alexisxander817]

You are such an amazing teacher; everything you explain is understood by me at once, and I am not even a meritorious student lol... thank you

[@yashspr]

I have never come across a better teacher than you sir. Hats off!

[@NguyenTuan-ek1pv]

The best teacher ever on KZbin. +1 vote!

[@XYZ-nz5gm]

not many people can explain this well even though they understand inside out. You did a really good job!

[@Deepak-jk1eh]

because of your videos i study only one night before of exam ,you r making every student life very easy by just giving these all videos in free ,so thanks you sir .

[@gaurav_jha]

Just brilliant, it's a privilege to have a teacher like you.

[@gnanajeyam6259]

The way you are explaining the recursion (DFS) is the unique skill you have. I appreciate your time for making this video's. Hope this will helps many people.

[@kurru_kamiz3458]

does not sound like a compliment

[@sumanthn5120]

​@@kurru_kamiz3458why?it did sound like one

[@f4lld4ark3]

Best video professor, much hq quality, very nice kanimambo

[@MBindu-kc2nj]

Very helpful sir thank you. Initially I thought your videos are too lengthy but now I realized your way of teaching is the best.

[@michaelekoka3263]

This is an excellent explanation for the backtracking technique to solve this problem. An important precision about this approach, that is missing from the video and that may trip up or confuse the problem solver is that the *weights must be positive*. Without this precision, the bounding function doesn't make sense, since at the time we exceed the target sum during traversal, a later negative weight could bring it to target. So this backtracking approach works only if the weights are positive.

[@ahdibiaimene3588]

You deserve all my respect sir , such a great teacher i wish you all the best

[@surajkumar-px5lf]

I don't go class because I know you will clear my all concept before exam. My teacher also made pdf from your lecture's screenshot. You are truly amazing. Sir

[@droptimistic7419]

I was just misunderstanding of something and by seeing this great video all confusions became clear, thank you

[@M-aggi-e]

By far the best explanation Sir. Thank you very much.

[@rajmourya35]

the way of teaching is so unique. awesome content sir.

[@adarshshenoy0623]

Thank you so much sir for your videos it ws too good and the way your explaining the concepts are not complicated . It helped me a lot thank you once again.

[@bk5268]

Tq u sir it is very useful me because tmr my daa exam tq u so much it is one of the my dout how to solve this but now i know how to subsititute

[@jimmiejohnsson2272]

Great explanation, good example and very easy to follow. I managed to implement and use this very quickly. Thanks a lot!

[@yashjamsandekar5173]

Thankyou so much sir !!!!! The way you explained was way more better than any teacher I've came across.

[@mekalasailatha8613]

It may be any tough sum,u make it easier by your explanation 😊

[@ShubhamKumar-wq9kw]

content is good...including pseudocode explaination would be really helpful

[@damansaroa]

+1

[@subinaypanda9936]

Sir have already explained how to solve the problem. Now it's your task of solving the whole problem.

[@codelearner3666]

thank you so much, sir, your videos are really knowledgeable and helpful.

[@rakshakedlaya8752]

You explained it very well... This video helped me a lot...Thank you so much sir❤🙏

[@anaghaprabhu9293]

I appreciate ur work sir. You are really amazing. .

[@arafatahmmed263]

Thn...x for your explanation. Addition or discussion of time and space complexity will make you unique form others.

[@marypulapa3743]

Sir outstanding explanation ... Sir really its easy to understand

[@cswalker21]

Thanks Abdul! Very clear walkthrough of backtracking! It helped me greatly. LOL at the inconsequential arithmetic mistake at 6:39! ;) just shows you're human!

[@vikasgoutam02]

I also notice.

[@ivandrofly]

yeah, noticed as well :D

[@bharatishinde7169]

NICE METHODS AND WAY OF TEACHING

[@visakh_vijayakumar_]

thanks :) only suggestion is @ 6 : 40 it is 27 + 15 =42 ..

[@aadarshkumayan5960]

Very informative lecture series for starting with Backtracking

[@chandukrishna4809]

Thanks for the wonderful videos and It would be really helpful if you include writing code for this kind of DP, Back tracking Problems. May be, by watching your code, most people may get essence of "how to write code" for this kind of problems. My request is to include code for at least one problem of such type as including for all will be hectic.

[@vinayaktulsian6276]

Very nice sir thank you for helping us one day before our exam , you teach very well.

[@GopiNath-pe3qz]

Alaguseriel Azagu

[@tng3100]

Just saw this video on morning of my sem exam for 4 min ,dayumm just helped a lot ,didn't expect they would ask this. Guess im so lucky afterall

[@NIKHIL-nv8wu]

Thank you sir for good video lecture,I can understand easily

[@bgminever7436]

Sir u will get world's best teaching skills person🙏Award

[@footballforyou8856]

Thanks a lot sir.good explanation.

[@VipulDhaigude]

Such simple and excellent explaination.

[@francomartnlumovich4323]

Very good video. I want to add an improvement to this backtracking. You can add another bonding function, if w array is sorted ascending so X_(i-1) < X_i < X_(i+1) then you know if adding X_i is already greater than m then you kill the node and it's brothers because X_i+1 > X_i

[@SahdevSingh-io3qp]

But sorting also takes some time O(nlogn) and here you are taking time to reduce time, which is meaningless

[@snigdhakasimahanthi3963]

Amazing explanation! Thank you very much!

[@himanshusingh3056]

Superb Explanation for this problem !

[@ok123ut]

amazing explanation on this!

[@pradeepalluri1195]

Very nice explanation sir

[@FaKe-rq7cu]

Very good explanation. I had a little doubt, at 8:18 shouldn't it be greater than or equal to 'm' instead of greater than 'm' in 2nd bounding function. Eg if arr = [1,2,3] & sum = 6, then after including 1 ( [1,5] ), the 2nd bounding function will not let it go further (even though taking all elements would have generated the sum).

[@anuragjoshi667]

Yeah, It seems so. Should have been ≥ m.

[@mentisdominus]

The 2nd bounding function is correct. It should be greater than m. You only apply the 2nd bounding function when descending down the right branch. When you descend down the right branch, it means that x[i]=0. In your example, after [1,5] and descending down the right branch x[2]=0 which means that 2 will not be included in the solution. The 2nd bounding function is telling you that you will not have enough values to reach the sum 'm' because the values going down the right branch will not be included in the solution. So for arr[1,2,3] and m=6, after taking 1 but not taking 2, you can't reach the value m=6.

[@peksn]

No because if the rest of the weights can't add up to the number you are searching for then why continue? If the sum of your current sum plus the rest of the objects are less than that number then you'll never get it, so you stop.

[@rajanarasada2081]

Super explanation sir I hope this explanation will make all queries clear

[@sankeerthreddy9865]

Master of teaching😃

[@saicharan8675]

Hi Sir, Thanks for the very good explination

[@Nagasuhas_Shastry_M]

Sir please make videos about other core computer science subjects Thank you sir great explanation

[@captainsamar]

Very well explained Abdul

[@mandilal94]

Excellent Teaching sir.Thank you

[@itsupport8245]

Sir, pls give us code with this problem..

[@hitmandevil6935]

Sir, the way you explain is actually great (it clears the concepts well). But I have a question, how to implement these solutions in a program, how to code these strategies with an efficient implementation. It would be very kind of you if you attach a link in the description (or make some more videos) stating the codes and what's the idea behind its efficient implementation. Thanks in advance....!!!

[@vincentrastello720]

Great explanation, much better than my professor

[@priyankarangarajan9336]

You take class awesome sir mainly this subset class sir i learn subset sir👌👌👌

[@-PriyankaReddy-tk5ti]

Seriously ... my professor given same example...I think she watches ur vedios 😂😂😂😅

[@samudraladivya992]

Same 😅😅😅

[@kingwillbeking3110]

Oh yeah, *Vedio.*

[@BiswajitDas-lk7pp]

Same here also

[@nikitamishra1126]

Ya same here..even my professor gave the same example🤭

[@vinit173]

Same 😂

[@shilpapushparaj9988]

Excellent teaching 😎😎

[@sohaibanwaar5181]

Great Work Sir! Thank you

[@henryzhang2992]

The time complexity for this is still exponential. Consider the case where all of the elements are 1 and the last element is massive. If the target sum is less than the less element but more than all the other elements combined, no nodes are pruned

[@SahdevSingh-io3qp]

See the second bounding condition, if the considered weight + total remaining weight is less than target sum, then no need to search further

[@SahdevSingh-io3qp]

At first call, your example will be terminated

[@fernandosanchezvillanueva4762]

Save me the day!! I will see you on Udemy

[@balajisolunke4482]

THANK YOU SIR , YOUR EXPLAINATION WAS SO EXCELLENT

[@relaxationmusic3535]

what an explaination just outstanding thanku so much sir

[@DhruvPatel-km8kj]

Excellent work..

[@shoaibshaik1507]

Mashallah Sir aap ki class superb...Ur teaching mind-blowing sir 👍

[@abdul_bari]

Thanks for liking

[@vinitsunita]

crisp and clear explaination

[@RAGHUNATHSINGHBCI]

Thank you sir, I love your explaination😍 just one suggestion keep video time minimum for other video

[@gopikrishna1551]

sir what is the time complexity for this problem? do we consider height as timecomplexity?

[@satyamgupta5234]

Hats off||It helped me a lot thank you once again.

[@ItsmeBhanu.19]

wonderful teaching sir thank u so much

[@priyanshigupta1359]

best explanation ever , thanks sir

[@gsreddy2654]

Thank you sir that was really very helpful

[@alfabinomial6183]

wow !! so intelligent lecture !! sir

[@abhishekdubey9268]

thank you sir , thank you sooo much sir .....my concept is completely cleared

[@santanu3633]

Thanks.... really nice explanation

[@luis-azanza]

Amazing, thank you!!

[@user-dd4en4jo9e]

This man is a savior.

[@svarajdhanulkar1791]

Sir ji dhnayaavad bot thanku apkaa. Iss sem ka Daa aap hi nikalonge mera😊

[@yizhang7027]

State-space tree is such an amazing tool. Why haven't I heard about it earlier?

[@abmsamsuzzaman4805]

To understand the algorithm your videos are awesome. But I would suggest if you could please add the pseudocode at least while explaining the algorithm it would been more helpful.

[@sepehrshahsavar9943]

thank you for your awesome tutorials sir , could you please make a video for monte carlo algorithm ?

[@battlefist6884]

sir once came to our college , when i was in second year , hope once agian he will come to for gest lecture on DAA

[@member828]

I need to write a paper about the sum of subsets - backtracking, do you have any suggestions for good resources?

[@miguelduarte4287]

you re the real king, Abdul Bari

[@santaram4687]

Sir what is variable size tuple formation for solving sum of subsets using backtracking???

[@c.danielpremkumar8495]

What if some of the weights/elements were to be negative ? Would it be different kind of problem altogether ?

[@pankajkumarprasad1489]

Best explanation ever 😊

[@amirawaheed3714]

Many many thanks, i understanded it very well

[@kamal-kz4xs]

Nice sir, can you upload the code?

[@mokshjain4623]

great explanation

[@sangeethamshare]

Sir, please publish a video for the same problem using DP. Thanks

[@irmachan1]

I love you man. thank you

[@noorullahkhan7482]

Sir, please upload a video on sum of subsets using dynamic programming.

[@nuriagiselaocampo5467]

Colaboren con este excelentísimo !

[@ChillitsmecarlChill]

Ye toh Abdul baari haii ye toh acha bacha haiii, ye duayein sunta haiii, achi baatein batata haii 💆🧘

[@mumbaikachallenge5526]

Beautiful explained❤️

[@mohammedadel8948]

Thank you for your hard work

[@huseyinbarin1653]

Man, you're really great!!

[@sonucksgowda2351]

excellent teaching sir