How do you write an algorithm to count all subsets of strings in a string.
Réponses aux questions d'entretien
Utilisateur anonyme
8 nov. 2015
int count(string &s)
{
return pow(2,s.size());
}
Utilisateur anonyme
9 mars 2017
Both answers above are incorrect, as there can be repeats.
1
Utilisateur anonyme
14 juil. 2017
So, what's the answer if all previous answers were wrong?
Utilisateur anonyme
18 juil. 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.