Add new exercises to Ruby
One of the easiest ways to add new exercises to the Ruby 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 Ruby.
icon links to the generic, language-independent problem description
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 Ruby track repository on GitHub.
Write a function to determine if a list is a sublist of another list.
Simulate a bank account supporting opening/closing, withdraws, and deposits of money. Watch out for concurrent transactions!
Correctly determine change to be given using the least number of coins
Implement a basic reactive system.
Implement an evaluator for a very simple subset of Forth
Parallel Letter Frequency
Count the frequency of letters in texts using parallel computation.
Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
Variable Length Quantity
Implement variable length quantity encoding and decoding.
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.
Creating a zipper for a binary tree.
Reparent a graph on a selected node
Count the rectangles in an ASCII diagram.
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.
Calculate the number of steps to reach 1 using the Collatz conjecture
Diffie-Hellman key exchange.
Refactor a Markdown parser
Parsing a Smart Game Format string.
Write a Domain Specific Language similar to the Graphviz dot language
Implement various kinds of error handling and resource management
Count the scored points on a Go board.
Implement the logic of the hangman game using functional reactive programming.
Refactor a ledger printer.
Use lenses to update nested records (specific to languages with immutable data).
Refactor a tree building algorithm.
Create a sentence of the form "One for X, one for me."
Report network IO statistics