How do you write an algorithm to count all subsets of strings in a string.

Question

Ben · Accepted Answer

Both answers above are incorrect, as there can be repeats.

Jay · Answer

int count(string &s)
{
   return pow(2,s.size());
}

BG · Answer

So, what's the answer if all previous answers were wrong?

Anonimo · Answer

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.

Bloomberg

Domanda di colloquio di Bloomberg

Risposte di colloquio

Aziende seguite

Ricerche di lavoro