You are given a string, which will contain ordinary a-z characters. (You can assume this will always be the case in any test, and assume that all letters will be lowercase as well). You must determine how many unique combinations can be made of the individual characters in the string, and print that number.
However, duplicate letters can be ignored in counting the possible combinations. In other words, if the string given is "hello", then simply switching the positions of the two
ls does not count as a unique phrase, and therefore cannot be counted towards the total.
Shortest byte count wins, looking forward to seeing some creative solutions in non-golfing languages!
hello -> 60 aaaaa -> 1 abcde -> 120