6.2 Sum Of Subsets Problem - Backtracking

Sum of Subsets problem

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[monishpidugu]

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

[ayounghosh]

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.

[manish]

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

[yashspr]

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

[NguyenTuan-ekpv]

The best teacher ever on Youtube.
+1 vote!

[alexisxander]

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

[gnanajeyam]

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.

[michaelekoka]

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.

[Deepak-jkeh]

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 .

[unscripted_india]

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

[surajkumar-pxlf]

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

[gaurav_jha]

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

[sahilsalhaj]

clear, concise, short and explained each step perfectly! great video

[XYZ-nzgm]

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

[visakh_vijayakumar_]

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

[flldark]

Best video professor, much hq quality, very nice kanimambo

[ShubhamKumar-wqkw]

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

[MBindu-kcnj]

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

[FaKe-rqcu]

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

[rajmourya]

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