Mutations (Basic Algorithms) - Incorrect test case

The challenge description states: Return true if the string in the first element of the array contains all of the letters of the string in the second element of the array.

According to that the case: mutation(["Mary", "Aarmy"]) should return false because the first string has only one a character, therefore does not contain all of the characters of the second string. Currently that test case returns true.

[donofriov]

I agree! If updating instructions is the route the members want us to go then I think it would make the most sense to just remove mutation(["Mary", "Aarmy"]) from the acceptance criteria and not mention anything about duplicates in the instructions. This way there won’t be any confusion. If it’s left in, then I would assume I would have to solve for this use case. As you said it’s more a beginner challenge so this may add some unwanted complexity to deal with duplicates at this level.

[donofriov]

@erictleung well I do agree that the test is okay, I don’t necessarily think that phrasing clarifies it. A subset generally means that all of the second string would be in the first one, which brings us back to Aarmy not fitting into Mary but line still working for Alien.