Solution Of Subset Sum Problem Using Recursion | FREE DSA Course in JAVA | Lecture 43

Subset sum problem in java | subset sum problem recursive solution | Solution to subset sum problem | subset sum problem solution in java | Recursion problems for coding | Coding rounds question in java | Java placement questions
The subset sum problem has been asked in a number of companies and the problem read as -
Given a set of non negative integers, and a value sum, determine the number of subsets of the given set with sum equal to given sum.
Whenever you see questions around print all, find all or sum of all, you should always think of a recursive approach.
8/10 times you'll find that you will be able to solve a problem using recursive approach under this category.
In this subset sum problem question also we can use a recursive approach and easily write a program to solve it.
Let's see in this lecture the concept and code to solve the subset sum problem in java.
Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course.
Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - • Data Structures And Al...
For more information, fill this form: forms.gle/8eiU...
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacad...​
#dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder

[@HemaK-f1o]

Wonderful

[@cigdemturan-wb1hh]

Thank you very much. Perfect explanation.

[@gopirajuo5872]

Sir maybe now u didn't get the proper response for your videos but please believe me sir in few months this is the only channel will come to everyone mind to study the dsa in java please don't stop u r flow sir

[@AvinashKumar-jf9mx]

explanation is top class. i want to learn complete DSA

[@harshpal9633]

what a video .............. sir please do comment student for motivation

[@starksaif3870]

most underated coding channel

[@bro-code4692]

the visual explaination made it so so better to understand

[@naveenkumar7726]

Thanks for the explanation.>This will not work, when the array is {1,0} and sum = 1;

[@xxcodingtime]

perfect perfect perfect

[@ishikajain1556]

Kindly discuss space and time complexity along with programs

[@suryateja510]

Can any one tells how to print the values of subsets like 10 15 and 20 5 values instead of count 2.

[@pratikpawar7934]

Great teaching ❤️

[@TAPACADEMY]

Thank you! 😃

[@ArunKumar-vd8zt]

my rating for your teaching infinity/10

[@salmanpatel2968]

Those who are watching his videos please write comments so sir can get motivate from us by the way good efforts sir really i appreciate you

[@TAPACADEMY]

So nice of you

[@sdet1491]

Excellent visual representation. I have been following some other online sources, but the way you are explaining the solution is unforgettable.

[@TAPACADEMY]

Do subscribe to the channel.

[@mk6263]

​@@TAPACADEMY sir plz plz
continue the lectures sir...

[@ramandeepsingh8464]

If the array contains arr[9] and k = 0 when total number of subset whose sum == 0 will be 0 but sir your code will return 1 fails the test case

[@nakedtruth583]

sir, this is an amazing presentation of this code, in other youtube channels I get to know don't get deep into recursion but in this lecture, I was feeling like I'm walking with recursion and going deeper inside, and with values recursion also let me in and out,(and concept is crystal clear) please make more videos I've subscribed first then liked.

[@TAPACADEMY]

You are most welcome. Do subscribe to the channel and share it in your community.

[@namratam1522]

The best teaching style, best visual representation. I cannot thank you enough for this great work ! You are doing a social work for future engineers! Thanks a ton !!!!!

[@wolfrikz7238]

Thank you so much sir, for amazing explanation

[@ChallaSrilakshmi-pk4hh]

Sir i want your full dsa course andni watched your 109 classes what can i do sir to get your entire course

[@bhuvaneshd3250]

Sir could you make dynamic programming playlist

[@sunilroshan7013]

Why here we not using i++ instead i+1 in the recursive function??

[@suryateja510]

In Recursion post increment operator wont works because it increments after the job, if you call post increment every time it picks the same value, then loop goes to infinity, use the pre increment like --i or i+1 only.

[@ayushpatel4475]

Speechless explanation 👏👏👏,i have no words ☺️

[@hridoysheikh-t6i]

Great Explanation Sir. this is an amazing visual presentation of this code. I sincerely apologize to you, Sir, as a Bangladeshi.

[@aman2002]

If sum=1
And arr[1,0]
The total number of possible subset is 2, but your codes return only 1. Which fails this test case.

[@fakeid2060]

Clearly understood...... Super

[@mayanktiwari3103]

great explanation

[@VARINDERSINGH-zn8mp]

good work

[@TAPACADEMY]

Thank you! Cheers!

[@sujithsaikalakonda4863]

Hello sir. Great content and great effort. Thank you sir.

[@ManishaJain-d7u]

Great sir❤🎉