1
exercism fetch haskell anagram

Anagram

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".

Hints

To complete this exercise you need to implement the function anagramsFor, that takes a word and a group of words, returning the ones that are anagrams of the given word.

If it is your first time solving this exercise, it is recommended that you stick to the provided signature:

1
anagramsFor :: String -> [String] -> [String]

Later, it may be a good idea to revisit this problem and play with other data types and libraries:

The test suite was intentionally designed to accept almost any type signature that makes sense, so you are encouraged to find the one you think is the best.

Getting Started

For installation and learning resources, refer to the exercism help page.

Running the tests

To run the test suite, execute the following command:

1
stack test

If you get an error message like this...

1
No .cabal file found in directory

You are probably running an old stack version and need to upgrade it.

Otherwise, if you get an error message like this...

1
2
No compiler found, expected minor version match with...
Try running "stack setup" to install the correct GHC...

Just do as it says and it will download and install the correct compiler version:

1
stack setup

Running GHCi

If you want to play with your solution in GHCi, just run the command:

1
stack ghci

Feedback, Issues, Pull Requests

The exercism/haskell repository on GitHub is the home for all of the Haskell exercises.

If you have feedback about an exercise, or want to help implementing a new one, head over there and create an issue. We'll do our best to help you!

Source

Inspired by the Extreme Startup game https://github.com/rchatley/extreme_startup

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.