What is the fastest way to find all subsequences of a string?

1

Ex → string s = “abc”

int n = s.size();
so its subsequences will be
a,ab,abc,b,bc,c,ac,""

what is the fastest way to find all the subsequences ?

2

"ac" is not a substring of string “abc”.
It is a valid subsequence not a substring.

3

okay…sorry

then whats the fastest way to find all the subsequences ? ?

4

you can refer this - Print all subsequences of a string - GeeksforGeeks

2 Likes
5

okay thank you.