Reverse words
Write a function that takes a string containing words (one or more sentences) and returns a string containing the words in reverse order.
Examples
(reverse-words "my name is Eric.") ;;=> "Eric. is my name"
(reverse-words "hello") ;;=> "hello"
(reverse-words "I love you") ;;=> "you love I"
Note: Words are characters separated by whitespace.
Thanks to this site for the problem idea, where it is rated Very Hard in Java. The problem has been modified.
Please submit your solutions as comments on this gist.
To subscribe: https://ericnormand.me/newsletter
Here's what I got. Look similar to the others. (Noted about rseq being faster, thanks @miner.)
Also, as above my split assumes only single space and not tab. It does keep the spacing in the return string but not sure if that's a feature or a bug :)