Exercises on the Rust Track | Exercism

Hello World

The classical introductory exercise. Just say "Hello, World!"

Leap

Given a year, report if it is a leap year.

Raindrops

Convert a number to a string, the contents of which depend on the number's factors.

Nth Prime

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

Beer Song

Produce the lyrics to that beloved classic, that field-trip favorite: 99 Bottles of Beer on the Wall.

string concatenation

vector optional

Proverb

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

Difference Of Squares

Find the difference between the square of the sum and the sum of the squares of the first N natural numbers.

Sum Of Multiples

Given a number, find the sum of all the multiples of particular numbers up to but not including that number.

Grains

Calculate the number of grains of wheat on a chessboard given that the number on each square doubles.

Prime Factors

Compute the prime factors of a given natural number.

Armstrong Numbers

Determine if a number is an Armstrong number

Reverse String

Reverse a string

Gigasecond

Given a moment, determine the moment that would be after a gigasecond has passed.

Bob

Bob is a lackadaisical teenager. In conversation, his responses are very limited.

string functions

Matching Brackets

Make sure the brackets and braces all match.

stack or recursion

Clock

Implement a clock that handles times without dates.

DOT DSL

Write a Domain Specific Language similar to the Graphviz dot language

builder pattern

Simple Linked List

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

type conversion

Pascal's Triangle

Compute Pascal's triangle up to a given number of rows.

Paasio

Report network IO statistics

Nucleotide Count

Given a DNA string, compute how many times each nucleotide occurs in the string.

ETL

We are going to do the `Transform` step of an Extract-Transform-Load.

Acronym

Convert a long phrase to its acronym

Sieve

Use the Sieve of Eratosthenes to find all the primes from 2 up to a given number.

while let optional

RNA Transcription

Given a DNA strand, return its RNA Complement Transcription.

Triangle

Determine if a triangle is equilateral, isosceles, or scalene.

Grade School

Given students' names along with the grade that they are in, create a roster for the school

Binary Search

Implement a binary search algorithm.

Robot Simulator

Write a robot simulator.

Queen Attack

Given the position of two queens on a chess board, indicate whether or not they are positioned so that they can attack each other.

Bowling

Score a bowling game

goofy bowling logic

Tournament

Tally the results of a small football competition.

Alphametics

Write a function to solve alphametics puzzles.

external crates optional

Two Bucket

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

Spiral Matrix

Given the size, return a square matrix of numbers in spiral order.

nested structures

Palindrome Products

Detect palindrome products in a given range.

string comparison

Saddle Points

Detect saddle points in a matrix.

Isogram

Determine if a word or phrase is an isogram.

Say

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

string concatenation

Run Length Encoding

Implement run-length encoding and decoding.

string concatenation

use of primitive char

int string conversion

ISBN Verifier

Check if a given string is a valid ISBN-10 number.

int string conversion

Perfect Numbers

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

Hamming

Calculate the Hamming difference between two DNA strands.

Scrabble Score

Given a word, compute the scrabble score for that word.

hashmap optional

higher order functions

Pangram

Determine if a sentence is a pangram.

All Your Base

Convert a number, represented as a sequence of digits in one base, to any other base.

Allergies

Given a person's allergy score, determine whether or not they're allergic to a given item, and their full list of allergies.

bitwise probably

Variable Length Quantity

Implement variable length quantity encoding and decoding.

Pig Latin

Implement a program that translates from English to Pig Latin

regular expressions

Atbash Cipher

Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.

primitive types

Crypto Square

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

primitive types

Rotational Cipher

Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.

primitive types

Simple Cipher

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

Rail Fence Cipher

Implement encoding and decoding for the rail fence cipher.

string permutation

Anagram

Given a word and a list of possible anagrams, select the correct sublist.

Protein Translation

Translate RNA sequences into proteins.

Robot Name

Manage robot factory settings.

OCR Numbers

Given a 3 x 4 grid of pipes, underscores, and spaces, determine which number is represented, or whether it is garbled.

React

Implement a basic reactive system.

Space Age

Given an age in seconds, calculate how old someone is in terms of a given planet's solar years.

trait implementation

Wordy

Parse and evaluate simple math word problems returning the answer as an integer.

operators optional

Sublist

Write a function to determine if a list is a sublist of another list.

generic over type

Custom Set

Create a custom set type.

generic over type

Minesweeper

Add the numbers to a minesweeper board

Rectangles

Count the rectangles in an ASCII diagram.

Circular Buffer

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

buffer reimplementation

Luhn

Given a number determine whether or not it is valid per the Luhn formula.

higher order functions

Luhn From

Luhn: Using the From Trait

higher order functions

Luhn Trait

Luhn: Using a Custom Trait

higher order functions

Largest Series Product

Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.

higher order functions

Word Count

Given a phrase, count the occurrences of each word in that phrase.

Phone Number

Clean up user-entered phone numbers so that they can be sent SMS messages.

Diamond

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

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.

higher order functions

Fizzy

Implement FizzBuzz using advanced generics

Roman Numerals

Write a function to convert from normal numbers to Roman Numerals.

Pythagorean Triplet

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

Series

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

Collatz Conjecture

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

Diffie Hellman

Diffie-Hellman key exchange.

Parallel Letter Frequency

Count the frequency of letters in texts using parallel computation.

multi threading

Macros

Implement a macro using macros-by-example

macros by example

Poker

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

Grep

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

string functions

Scale Generator

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

Decimal

Implement a Decimal type

external crates optional

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.

Dominoes

Make a chain of dominoes.

Forth

Implement an evaluator for a very simple subset of Forth

parser reimplementation