7. Subsequences, Power Set using Recursion Code - Practise with me, understand code in detail! 🚀🔥

[@codefromscratch-keertipurswani]

How does it feel to solve medium level recursion questions? ❤️

[@cricketguru7596]

Visualization of recursive tree was little difficult? Having a high hope, after going through this series i will be more comfortable

[@codefromscratch-keertipurswani]

@@cricketguru7596 let me know if you have any doubts. M here. You just watch the videos properly!

[@cricketguru7596]

@@codefromscratch-keertipurswani yes sure

[@Nishchay-kc1gb]

Now i am understanding more clearly and speed has increased a bit

[@yuv09]

The question is rated easy, but it seems like hard one 😅😅😅

[@unknowncoder409]

Yes the second catch was that we had to remove the empty string from the resultant vector as it is asked in the problem statement. Thank you Mam for great teaching!!!

[@sameer9368]

Since I am your senior experience wise... I always follow your video the way you provide detail explanation...please keep motivating us

[@Hustle_bussle]

I hope I can explain every DSA concept as easily as you do!!Looking forward to that day✌🤞

[@codefromscratch-keertipurswani]

You will be able to! I am so sure ❤️

[@saurabhbera4833]

I used to get scared using recursion. But these days I think recursion is fun it's all about recursive faith😂❤️

[@rajinderkaur7658]

Great explanation mam👌gaining confidence day by day only because of you💪thankyou❤more power to you❤❤❤

[@arjunyadav-kt5jr]

i could figure out the second catch easily, because keerti does not let us forget anything!!

[@swathijaishetty460]

Thanks for putting so much of efforts, to make us understand clearly :)

[@MdRizwan-uu9dv]

Thankyou didi for this wonderful explanation👌👍👌👍👌

[@bharanisrianbalagan1924]

such a nice explanation ever

[@prakashbtw678]

I have been waiting for this. Thank you thank you

[@nidhikumari1479]

Thank you so much mam! Solving a medium level rec. ques. feels great.👍

[@codefromscratch-keertipurswani]

Yaaaay. Awesome Nidhi!

[@simranvolunesia]

SUMMARY ============================= Write code for including character and excluding character Push "curr_subsequence" to "ans" when curr_idx == n Another way to remove the empty string from "ans" is to pop_back before sorting REASON: empty string will always be added to "ans" at last only Alternative code class Solution{ public: void helper(string s, int curr_idx, int n, string curr_subsequence, vector &ans){ if(curr_idx == n){ ans.push_back(curr_subsequence); return; } // include character helper(s,curr_idx+1,n,curr_subsequence+s[curr_idx],ans); // not include character helper(s,curr_idx+1,n,curr_subsequence,ans); } vector AllPossibleStrings(string s){ vector ans; helper(s,0,s.length(),"",ans); ans.pop_back(); // remove empty string sort(ans.begin(),ans.end()); return ans; } };

[@MaheshBabuGurram]

Hi Keerthi, These videos are really helpful. I have shared it with my friend and they subscribed to the channel. One suggestion, could you discuss time and space complexity for each of the problems that you are covering?

[@muthukumara8792]

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target. Each number in candidates may only be used once in the combination. mam could you make a video to solve this?

[@rtarts1524]

Thank You Mam..

[@jasmindersingh6708]

We found 8 number of subsequences but they ask for only 7 subsequences. The extra one is empty (" ").

[@nidhibansaliitr]

I wrote it like a mix of iterative + recursive manner. Please share your view point on the code. void helper(List list, String s, String sChar, int total, int counter){ char [] charArray = s.toCharArray(); if(!list.isEmpty()){ int size = list.size(); for(int i =0; i

[@paraschauhan4466]

I also write dii current . length is greater than zero than res.pushbackcurrent

[@ashwinisunilchoudhari9660]

I have one doubt mam , after include helper get executed one time ,the next exclude helper should get executed.? but in explanation according to my understanding after first helper reached to n , base condition is executing and then exclude helper.

[@prashanthiaruna8501]

Am still in binary search only i practice in weekends as I don have time is this normal to be this slow ??

[@GauravKumar-by1yt]

Thank you

[@JardaniJovonovich192]

Thanks for the video. In GFG, it is mentioned that the expected space complexity is O(n*2^n). Shouldn't the SC be just O(2^n) ?

[@codefromscratch-keertipurswani]

Will cover this in a youtube short tomorrow. Should have talked about it. Thanks for pointing it out ❤️

[@div0007]

Think of SC as an array of array, where total elems in the outer array are 2^N and each element(which is also an array of char aka string) can have max length of N. so SC will be size each elem * number of elems or O(N*2^N)

[@nidhibansaliitr]

I was able to write code by myself. But your code is always more crisp.

[@codefromscratch-keertipurswani]

Hi Nidhi, could you please drop a mail (just a hi would do) at [e-mail]

[@jagdishkumawat2738]

💯🔥

[@ShubhamSingh-gk8vp]

let goooo !!

[@ashwaniarchivee]

Present ma'am.

[@deepchill5295]

Day 19- present 🙋‍♂️

[@mohdhaseeb9818]

Present Ma'am

[@nithishnair6265]

Present 👍

[@hackerIfeelYou]

Present ma'am 🤞

[@cricketguru7596]

Present 🔥

[@vigneshiyer1765]

Present mam!!

[@myth__un]

Present ma'am

[@devilnk8475]

Didi ...plz live stream ...

[@codefromscratch-keertipurswani]

What should we discuss in live stream? Anything specific in mind?

[@devilnk8475]

@@codefromscratch-keertipurswani 'Mam' if we have any doubts ask in live stream and we connect to directly...🥰🥰

[@surojitsantra7627]

🙋

[@Nishchay-kc1gb]

I am solving

[@varunendra.singh_]

Day 19🙋

[@VishalYadav-vt4cw]

🙋‍♂️

[@learner7940]

Did anyone do this in JS ?

[@utkarshawasthi1665]

Coding Prac Day 7 V3

[@sravantipris3544]

good

[@sachinaghera8189]

Present

[@arunkumarmohandas4420]

Present