Add new Go exercises
One of the easiest ways to add new exercises to the Go 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 Go.
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 Go track repository on GitHub.
Take a nested list and return a single list with all values except nil/null
Implement basic list operations
Run Length Encoding
Implement run-length encoding and decoding.
Write a function to determine if a list is a sublist of another list.
Calculate the number of steps to reach 1 using the Collatz conjecture
Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
Write a function to solve alphametics puzzles.
Make a chain of dominoes.
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.
For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output the full text of this proverbial rhyme.
Rail Fence Cipher
Implement encoding and decoding for the rail fence cipher.
Creating a zipper for a binary tree.
Count the rectangles in an ASCII diagram.
Given the size, return a square matrix of numbers in spiral order.
Implement complex numbers.
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.
Given two buckets of different size, demonstrate how to measure an exact number of liters.
Refactor a Markdown parser
Parsing a Smart Game Format string.
Write a Domain Specific Language similar to the Graphviz dot language
Count the scored points on a Go board.
Implement the logic of the hangman game using functional reactive programming.
Use lenses to update nested records (specific to languages with immutable data).