Add new exercises to Rust
One of the easiest ways to add new exercises to the Rust 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 Rust.
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 Rust track repository on GitHub.
Implement a clock that handles times without dates.
Calculate the date of meetups.
Given a number n, determine what the nth prime is.
Implement a binary search algorithm.
Implement the classic method for composing secret messages called a square code.
Determine if a word or phrase is an isogram.
Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for natural numbers.
Given a string of digits, output all the contiguous substrings of length `n` in that string.
Implement the `accumulate` operation, which, given a collection and an operation to perform on each element of the collection, returns a new collection containing the result of applying that operation to each element of the input collection.
Compute the prime factors of a given natural number.
Given a decimal number, convert it to the appropriate sequence of events for a secret handshake.
Implement a program that translates from English to Pig Latin
Given a number from 0 to 999,999,999,999, spell out that number in English.
Implement the `keep` and `discard` operation on collections. Given a collection and a predicate on the collection's elements, `keep` returns a new collection containing those elements where the predicate is true, while `discard` returns a new collection containing those elements where the predicate is false.
Binary Search Tree
Insert and search for numbers in a binary tree.
Given a diagram, determine which plants each child in the kindergarten class is responsible for.
Implement a doubly linked list
Detect palindrome products in a given range.
Implement basic list operations
Given a string representing a matrix of numbers, return the rows and columns of that matrix.
There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product a * b * c.
Detect saddle points in a matrix.
Implement a simple shift cipher like Caesar and a more secure substitution cipher
Take a nested list and return a single list with all values except nil/null
Generate the lyrics of the song 'I Know an Old Lady Who Swallowed a Fly'
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
Given a letter, print a diamond starting with 'A' with the supplied letter at the widest point.
Compute the result for a game of Hex / Polygon
Output the nursery rhyme 'This is the House that Jack Built'.
Simple Linked List
Write a simple linked list implementation that uses Elements and a List
Take input text and output it transposed.
Output the lyrics to 'The Twelve Days of Christmas'
Pick the best hand(s) from a list of poker hands.
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.
Rail Fence Cipher
Implement encoding and decoding for the rail fence cipher.
Creating a zipper for a binary tree.
Reparent a graph on a selected node
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.
For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output the full text of this proverbial rhyme.
Generate musical scales, given a starting note and a set of intervals.
Given two buckets of different size, demonstrate how to measure an exact number of liters.
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