Given a word and a list of possible anagrams, select the correct sublist.
Given "listen"
and a list of candidates like "enlists" "google" "inlets" "banana"
the program should return a list containing
"inlets"
.
Inspired by the Extreme Startup game https://github.com/rchatley/extreme_startup
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
(ns anagram-test
(:require [clojure.test :refer [deftest is]]
anagram))
(deftest no-matches
(is (= []
(anagram/anagrams-for "diaper" ["hello" "world" "zombies" "pants"]))))
(deftest detect-simple-anagram
(is (= ["tan"] (anagram/anagrams-for "ant" ["tan" "stand" "at"]))))
(deftest does-not-confuse-different-duplicates
(is (= [] (anagram/anagrams-for "galea" ["eagle"]))))
(deftest eliminate-anagram-subsets
(is (= [] (anagram/anagrams-for "good" ["dog" "goody"]))))
(deftest detect-anagram
(is (= ["inlets"]
(let [coll ["enlists" "google" "inlets" "banana"]]
(anagram/anagrams-for "listen" coll)))))
(deftest multiple-anagrams
(is (= ["gallery" "regally" "largely"]
(let [coll ["gallery" "ballerina" "regally"
"clergy" "largely" "leading"]]
(anagram/anagrams-for "allergy" coll)))))
(deftest case-insensitive-anagrams
(is (= ["Carthorse"]
(let [coll ["cashregister" "Carthorse" "radishes"]]
(anagram/anagrams-for "Orchestra" coll)))))
(deftest word-is-not-own-anagram
(is (= [] (anagram/anagrams-for "banana" ["banana"]))))
(deftest capital-word-is-not-own-anagram
(is (= [] (anagram/anagrams-for "BANANA" ["banana"]))))
(ns anagram
(require [clojure.string :as string]))
(defn- anagram? [word compare]
(let [word (string/lower-case word)
compare (string/lower-case compare)]
(and (not= word compare)
(= (frequencies word) (frequencies compare)))))
(defn anagrams-for [word possibilities]
(let [anagram-for-word? (partial anagram? word)]
(filter anagram-for-word? possibilities)))
A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.
Here are some questions to help you reflect on this solution and learn the most from it.
Level up your programming skills with 3,449 exercises across 52 languages, and insightful discussion with our volunteer team of welcoming mentors. Exercism is 100% free forever.
Sign up Learn More
Community comments
Separating out anagram predicate from list generation. The anagram predicate seemed a little too complicated to keep as an anonymous functions, so i forked it off into a named private function.
I originally hoped to avoid having to repeatedly compute the character count, but I think the readability here is worth losing the premature optimization.