128 views

The number of possible subsequences in a string of length n are:

1. $n^{2}$
2. $2^{n}$
3. n!
4. n(n-1)

Which is equal to all possible subsets. For every character you have two choice either take or don’t.

by

1
200 views