Add new Haskell exercises
One of the easiest ways to add new exercises to the Haskell track is to translate them from other language tracks on Exercism. This page lists all of the problem specifications in the common pool of exercises which have not yet been implemented in Haskell.
The icon links to the language-independent description of the problem.
The icon links to the canonical test data.
We also link to all the implementations of each exercise in other languages, which you can use for inspiration.
Once you've picked an exercise, follow the instructions in this guide and submit your pull request to the Haskell track repository on GitHub.
Implement a binary search algorithm.
Take a nested list and return a single list with all values except nil/null
Create a sentence of the form "One for X, one for me."
A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
Implement a basic reactive system.
Take input text and output it transposed.
Tally the results of a small football competition.
To try and encourage more sales of different books from a popular 5 book series, a bookshop has decided to offer discounts of multiple-book purchases.
Pick the best hand(s) from a list of poker hands.
For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output the full text of this proverbial rhyme.
Given two buckets of different size, demonstrate how to measure an exact number of liters.
Count the rectangles in an ASCII diagram.
Determine if a number is an Armstrong number
Diffie-Hellman key exchange.
Variable Length Quantity
Implement variable length quantity encoding and decoding.
Refactor a Markdown parser
Create a program to solve a word search puzzle.
Search a file for lines matching a regular expression pattern. Return the line number and contents of each matching line.
Generate musical scales, given a starting note and a set of intervals.
Implement various kinds of error handling and resource management
Write a Domain Specific Language similar to the Graphviz dot language
Refactor a tree building algorithm.
Implement the logic of the hangman game using functional reactive programming.
Refactor a ledger printer.
Implement rational numbers.
Report network IO statistics