clojure-hackos.word-frequencies
Solves the Hash Tables: Ransom Note challenge. See: https://www.hackerrank.com/challenges/ctci-ransom-note
proper-subset-of?
(proper-subset-of? m n)Returns ‘Yes’ if every word in n occurs at least as many times as in m; returns ‘No’ otherwise.