Add new exercises to Elixir

One of the easiest ways to add new exercises to the Elixir track is to translate them from other language tracks on Exercism. This page lists all of the exercises that exist on Exercism, but have not yet been implemented in Elixir.

The icon links to the generic, language-independent problem description

The icon links to the canonical test data

The language icons link to each existing implementation of the problem.

Once you've picked an exercise, follow the instructions in the Contributing Guide and submit your pull request to the Elixir track repository on GitHub.




Binary Search Tree

Insert and search for numbers in a binary tree.

Linked List

Implement a doubly linked list

Circular Buffer

A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.

Food Chain

Generate the lyrics of the song 'I Know an Old Lady Who Swallowed a Fly'


Implement a basic reactive system.


Output the nursery rhyme 'This is the House that Jack Built'.


Write a function to solve alphametics puzzles.


Take input text and output it transposed.


Make a chain of dominoes.

Variable Length Quantity

Implement variable length quantity encoding and decoding.

Book Store

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.


Reparent a graph on a selected node


Count the rectangles in an ASCII diagram.

Word Search

Create a program to solve a word search puzzle.


For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output the full text of this proverbial rhyme.

Two Bucket

Given two buckets of different size, demonstrate how to measure an exact number of liters.

Zebra Puzzle

Solve the zebra puzzle.

Collatz Conjecture

Calculate the number of steps to reach 1 using the Collatz conjecture

Sgf Parsing

Parsing a Smart Game Format string.

Error Handling

Implement various kinds of error handling and resource management

Go Counting

Count the scored points on a Go board.


Implement the logic of the hangman game using functional reactive programming.


Refactor a ledger printer.

Lens Person

Use lenses to update nested records (specific to languages with immutable data).

Tree Building

Refactor a tree building algorithm.

Two Fer

Create a sentence of the form "One for X, one for me."


Report network IO statistics