How do you write an algorithm to count all subsets of strings in a string.
Respostas da entrevista
Sigiloso
8 de nov. de 2015
int count(string &s)
{
return pow(2,s.size());
}
Sigiloso
9 de mar. de 2017
Both answers above are incorrect, as there can be repeats.
1
Sigiloso
14 de jul. de 2017
So, what's the answer if all previous answers were wrong?
Sigiloso
18 de jul. de 2017
sort the character array for the string then employ the algorithm to find all subsets without duplicates (backtracking algorithm) but don't actually store the result strings just count the number of them.