Not that i matters much in that case, but the set finds something in O(log n) and the char array O(n), but the tree inside may make it slower.
I would just sort the char array and use binary_search, thats about the same programming work as using find for better complexity as result.
Maybe you could also think about structuring the code in a way to allow loading the valid chars from a (level-)file later.