how do we count the number
Subsequences recursion
no of subsequence of string of size n is 2^n
u can simply print that
or u can take a global variable c
or pass the c variable by reference and not by value
order of the o/p is in lexographically decreasing order
how to do in lexiographical order
add them to a global vector
sort the vector in reverse order
and then print it
i did not understand this how can we do it with my code
convert the char to string
just make a string and then print it in the end
but how does this print in lexiographical order
@vanisinghal0201i simply saw the pattern that we were getting
abcd abc abd ab acd ac ad a bcd bc bd b cd c d
but then we required it to be reverse
in the ouput ordering
so i simpy am adding the new subsequence at the front of the string
hence by this case d comes at the front and abcd reaches the end