subset sum problem dynamic programming | backtracking sum of subsets

This is a video lecture which explains subset sum problem solving using both backtracking and dynamic programming methods. This explanation is a little long but once you watch it, you won't ever regret about having watched such a long video. Backtracking takes exponential time to solve the subset sum problem therefore, we solve using it dynamic programming. I am sure you will love the explanation :)

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[aniketdubey]

the best of the explaination i had seen so far

[amarnaath]

IF YOU START AN ONLINE COURSE I LL BE THE FIRST ONE TO REGISTER

[ashishkulkarni]

Hi sir, you teach everything very cleanly...please keep teaching us😊

[aayush]

bro your explanation is the best! Other videos on youtube don't explain how the table is forming and the sub problems but you explain that.Thanks a lot!

[neghatnazir]

thanks a lot, i understood the concept behind filling this table, one syggestion it could b better explained using recurssion tree that includes sub problems.

[himalayagupta]

explained clearly, leaves no doubt in my mind, thank you sir.

[aditisharma]

Very well explained! You definitely need more likes..

[letsdoeverythinginoneweek]

clean and crisp
please make a video on time complexity ?how to find it
ur explanations are great

[niksgupta]

Would have been great if you explained memoization method before DP method. Good content btw! Thanks!

[dhruvgoel]

Very well explained 👍 thank you sir..keep making such videos

[dayanandraut]

understanding recursive intuition is easy, and writing that into dp was tough for me. but now if i can come up with recursive soln, i can easily write that into dp. Thanks to @Tech Dose

[durjaarai]

At 2:51, is it required to search the 2nd option if the 1st returns true?

Also, I wanted to thank you so much for the content. Solving this by hand and following along, helped me understand this concept.

[maverickchinmaydas]

@TECH DOSE - Nice video, well explained and I cleared doubt on how to track down the nodes but can you please tell me if I want to see what all subset elements are added to get the sum then how to track back from last node that is 3*5 = T

[ameynaik]

Great video! The space complexity for dp is O(sum*size(set)) for your method which is bottom-up. But I guess we can perform dp top bottom approach, the Space complexity can be reduced to O(sum+1). Is that correct?

[shikharjain]

Is it necessary for array to be sorted?

[i.vigneshdavid]

can you tell me how to print elements of subset

[pranavrajeshmadhani]

Can you please explain why we are considering 1 row above? that logic I am not clear with

[srinidhinm]

This solution also possible with O(n) space.

[saravanan]

Hi Tech Dose, the only request I am putting here is, Can you elaborate how the recursive formula came in every dynamic programming videos?
Because after seeing your recursive formula only I am able to understand the logic, If you do consider that also, it would be more helpful. Thanks in advance. And one more, the explanation was awesome!!!

[arunimadas]

Thanks a lot for this.❤️. I finally understood it 😭❤️ . Keep up the good work. :')