Add new ECMAScript exercises
One of the easiest ways to add new exercises to the ECMAScript 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 ECMAScript.
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 ECMAScript track repository on GitHub.
Given a DNA string, compute how many times each nucleotide occurs in the string.
Simulate a bank account supporting opening/closing, withdraws, and deposits of money. Watch out for concurrent transactions!
Implement an evaluator for a very simple subset of Forth
Tally the results of a small football competition.
Make a chain of dominoes.
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.
Parallel Letter Frequency
Count the frequency of letters in texts using parallel computation.
Rail Fence Cipher
Implement encoding and decoding for the rail fence cipher.
Creating a zipper for a binary tree.
Variable Length Quantity
Implement variable length quantity encoding and decoding.
Refactor a Markdown parser
Reparent a graph on a selected node
Implement various kinds of error handling and resource management
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.
Determine if a number is an Armstrong number
Write a Domain Specific Language similar to the Graphviz dot language
Count the scored points on a Go board.
Parsing a Smart Game Format string.
Refactor a tree building algorithm.
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