I think we can formulize your solution as follows:
Let n(A) : # of passwords without any number, n(B): # of passwords without any letter, n(C): # of passwords without any symbol, n(S): # of passwords in the full set.
Then, we calculate n(S)-n(A\cup B\cup C), where n(A\cup B\cup...