Anagram Solver

anagrams.elm

module Main exposing (..)

import Char
import Dict exposing (Dict)


createMap : String -> Dict Int (List String) -> Dict Int (List String)
createMap word dict =
    let
        key =
            word |> String.toList |> List.sort |> List.map String.fromChar |> String.concat

        update word =
            word :: (Dict.get key dict |> Maybe.withDefault [])
    in
        Dict.update key (always (Just (update word))) dict


anagrams : List String -> List (List String)
anagrams words =
    List.foldr createMap Dict.empty words |> Dict.values


main =
    anagrams [ "foo", "enlist", "bar", "listen", "silent" ] -- [["bar"],["foo"],["enlist","listen","silent"]]

anagrams.hs

module Main where

import Data.Char (ord, toLower)
import qualified Data.Map as Map
import Data.List (sort)


createMap :: String -> Map.Map String [String] -> Map.Map String [String]
createMap word map =
    let
        key = sort word
        update word = word : Map.findWithDefault [] key map
    in
        Map.alter (const (Just (update word))) key map


anagrams :: Foldable t => t String -> [[String]]
anagrams words =
    Map.elems $ foldr createMap Map.empty words


main = do
    wordList <- getContents
    mapM print $ anagrams $ words wordList
-- Pass the word list into the program via stdin