Exercises on the Julia Track | Exercism

Exercism v3 launches on Sept 1st 2021. Learn more! 🚀🚀🚀

Hello World

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

Leap

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

Nucleotide Count

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

Hamming

Calculate the Hamming difference between two DNA strands.

exception handling

RNA Transcription

Given a DNA strand, return its RNA Complement Transcription.

exception handling

pattern matching

Darts

Write a function that returns the earned points in a single toss of a Darts game

Bob

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

Run Length Encoding

Implement run-length encoding and decoding.

text formatting

Pangram

Determine if a sentence is a pangram.

Anagram

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

Binary Search

Implement a binary search algorithm.

Rotational Cipher

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

metaprogramming

string literals

Atbash Cipher

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

Difference Of Squares

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

Pascal's Triangle

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

exception handling

Raindrops

Convert a number to a string, the content of which depends on the number's factors.

Scrabble Score

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

Word Count

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

Luhn

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

Roman Numerals

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

Isogram

Determine if a word or phrase is an isogram.

ETL

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

Collatz Conjecture

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

exception handling

Sieve

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

Trinary

Convert a trinary number, represented as a string (e.g. '102012'), to its decimal equivalent using first principles.

Secret Handshake

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

Phone Number

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

pattern matching

regular expressions

Triangle

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

Clock

Implement a clock that handles times without dates.

multiple dispatch

Complex Numbers

Implement complex numbers.

multiple dispatch

Rational Numbers

Implement rational numbers.

multiple dispatch

Custom Set

Create a custom set type.

multiple dispatch

Robot Name

Manage robot factory settings.

Gigasecond

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

Robot Simulator

Write a robot simulator.

Resistor Color Trio

Convert color codes, as used on resistors, to a human-readable label.

text formatting

Grains

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

exception handling

Spiral Matrix

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

ISBN Verifier

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

metaprogramming

Armstrong Numbers

Determine if a number is an Armstrong number

Pythagorean Triplet

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

type conversion

functional programming

D&D Character

Randomly generate Dungeons & Dragons characters

test driven development

Reverse String

Reverse a string

text formatting

data structures

functional programming

Acronym

Convert a long phrase to its acronym

Prime Factors

Compute the prime factors of a given natural number.

Minesweeper

Add the numbers to a minesweeper board

text formatting

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 operations

Matching Brackets

Make sure the brackets and braces all match.

data structures

Perfect Numbers

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

functional programming

All Your Base

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

Circular Buffer

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

data structures