On: I don't like Python. Does that make me a bad person?

[wycats]

An easier Ruby solution would be:

("letters in this sentence" + "and this one").chars.sort.reverse

[_ivvf → wycats]

Except you aren't using sets, so you get duplicate characters.

I can just as easily write ("letters in this sentence" + "and this one").toSeq.sorted.reverse in scala. You could tag the end of your ruby statement with .uniq and you would be fine. Alternatively, you could wrap the above scala statement in TreeSet(). These solutions process things in a significantly different way than was done by the OP, though.

[wcarss → _ivvf]

("letters in this sentence".split(//) & "and this one".split(//)).sort.reverse.join

I'm just learning, but I think this performs it correctly with sets.