Sir this i'm not getting help me to built the logic for the program

#1

sir this i’m not getting help me to built the logic for the program

#2

Hey @Harsh_Sonwani
We traverse the string recursively. At each instance we have the choice whether or not to include our current character in the subsequence. -We consider both these possibilities by making two recursive calls at each instance. We append our current character into final output string in one of them and leave the other one as is. -In the base case when our input string has been traversed entirely , we simply print the subsequence generated. -The total number of these subsequences is equal to pow(2, len(str) ) , where str is the input string.

#3

can i call u?
ur no.?

#4

This logic is not clear ??
just tell me you know recursion ??
If you haven’t done a recursion leave it for now