# Rust

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

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 Rust track repository on GitHub.

### Clock

Implement a clock that handles times without dates.

### Meetup

Calculate the date of meetups.

### Nth Prime

Given a number n, determine what the nth prime is.

### Binary Search

Implement a binary search algorithm.

### Crypto Square

Implement the classic method for composing secret messages called a square code.

### Isogram

Determine if a word or phrase is an isogram.

### Perfect Numbers

Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for natural numbers.

### Series

Given a string of digits, output all the contiguous substrings of length `n` in that string.

### Accumulate

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.

### Prime Factors

Compute the prime factors of a given natural number.

### Secret Handshake

Given a decimal number, convert it to the appropriate sequence of events for a secret handshake.

### Pig Latin

Implement a program that translates from English to Pig Latin

### Say

Given a number from 0 to 999,999,999,999, spell out that number in English.

### Strain

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.

### Kindergarten Garden

Given a diagram, determine which plants each child in the kindergarten class is responsible for.

### Palindrome Products

Detect palindrome products in a given range.

### List Ops

Implement basic list operations

### Matrix

Given a string representing a matrix of numbers, return the rows and columns of that matrix.

### Pythagorean Triplet

There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product a * b * c.

Detect saddle points in a matrix.

### Simple Cipher

Implement a simple shift cipher like Caesar and a more secure substitution cipher

### Flatten Array

Take a nested list and return a single list with all values except nil/null

### Food Chain

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

### Bank Account

Simulate a bank account supporting opening/closing, withdraws, and deposits of money. Watch out for concurrent transactions!

### Change

Correctly determine change to be given using the least number of coins

### Diamond

Given a letter, print a diamond starting with 'A' with the supplied letter at the widest point.

### Connect

Compute the result for a game of Hex / Polygon

### House

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

Write a simple linked list implementation that uses Elements and a List

### Transpose

Take input text and output it transposed.

### Twelve Days

Output the lyrics to 'The Twelve Days of Christmas'

### Poker

Pick the best hand(s) from a list of poker hands.

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

### Rail Fence Cipher

Implement encoding and decoding for the rail fence cipher.

### Zipper

Creating a zipper for a binary tree.

### Pov

Reparent a graph on a selected node

### Word Search

Create a program to solve a word search puzzle.

### Grep

Search a file for lines matching a regular expression pattern. Return the line number and contents of each matching line.

### Proverb

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

### Scale Generator

Generate musical scales, given a starting note and a set of intervals.

### 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

### Diffie Hellman

Diffie-Hellman key exchange.

### Markdown

Refactor a Markdown parser

### Sgf Parsing

Parsing a Smart Game Format string.

### Dot Dsl

Write a Domain Specific Language similar to the Graphviz dot language

### Error Handling

Implement various kinds of error handling and resource management

### Go Counting

Count the scored points on a Go board.

### Hangman

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

### Ledger

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

### Paasio

Report network IO statistics