Add new Lua exercises
One of the easiest ways to add new exercises to the Lua track is to translate them from other language tracks on Exercism. This page lists all of the problem specifications in the common pool of exercises which have not yet been implemented in Lua.
The icon links to the language-independent description of the problem.
The icon links to the canonical test data.
We also link to all the implementations of each exercise in other languages, which you can use for inspiration.
Once you've picked an exercise, follow the instructions in this guide and submit your pull request to the Lua track repository on GitHub.
Create a sentence of the form "One for X, one for me."
Parse and evaluate simple math word problems returning the answer as an integer.
Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
Detect palindrome products in a given range.
Detect saddle points in a matrix.
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.
Implement a simple shift cipher like Caesar and a more secure substitution cipher
Implement complex numbers.
Determine if a number is an Armstrong number
Simple Linked List
Write a simple linked list implementation that uses Elements and a List
Given the size, return a square matrix of numbers in spiral order.
Output the lyrics to 'The Twelve Days of Christmas'
Compute the result for a game of Hex / Polygon
Make a chain of dominoes.
Implement an evaluator for a very simple subset of Forth
Pick the best hand(s) from a list of poker hands.
For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output the full text of this proverbial rhyme.
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.
Diffie-Hellman key exchange.
Parallel Letter Frequency
Count the frequency of letters in texts using parallel computation.
Given two buckets of different size, demonstrate how to measure an exact number of liters.
Creating a zipper for a binary tree.
Refactor a Markdown parser
Search a file for lines matching a regular expression pattern. Return the line number and contents of each matching line.
Generate musical scales, given a starting note and a set of intervals.
Implement various kinds of error handling and resource management
Implement rational numbers.
Count the scored points on a Go board.
Parsing a Smart Game Format string.
Write a Domain Specific Language similar to the Graphviz dot language
Refactor a tree building algorithm.
Score a single throw of dice in the game Yacht
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).
Report network IO statistics