From c9ca7fe09453a5466bf705ff5946ac441435024d Mon Sep 17 00:00:00 2001 From: Andrew Kvalheim Date: Mon, 10 Sep 2018 16:57:33 -0700 Subject: [PATCH 1/3] crypto-square: Fix misspelling --- exercises/crypto-square/description.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/crypto-square/description.md b/exercises/crypto-square/description.md index b172302262..02aee16004 100644 --- a/exercises/crypto-square/description.md +++ b/exercises/crypto-square/description.md @@ -57,7 +57,7 @@ chunks with a single trailing space. ``` Notice that were we to stack these, we could visually decode the -cyphertext back in to the original message: +ciphertext back in to the original message: ```text "imtgdvs" From 039ad86981e9a58abcb0c204f17dcd282a3adf61 Mon Sep 17 00:00:00 2001 From: Andrew Kvalheim Date: Mon, 10 Sep 2018 17:01:01 -0700 Subject: [PATCH 2/3] dominoes: Fix misspelling --- exercises/dominoes/description.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/exercises/dominoes/description.md b/exercises/dominoes/description.md index 3f0a2f618e..dc6ae180a9 100644 --- a/exercises/dominoes/description.md +++ b/exercises/dominoes/description.md @@ -2,8 +2,8 @@ Make a chain of dominoes. Compute a way to order a given set of dominoes in such a way that they form a correct domino chain (the dots on one half of a stone match the dots on the -neighbouring half of an adjacent stone) and that dots on the halfs of the stones -which don't have a neighbour (the first and last stone) match each other. +neighbouring half of an adjacent stone) and that dots on the halves of the +stones which don't have a neighbour (the first and last stone) match each other. For example given the stones `[2|1]`, `[2|3]` and `[1|3]` you should compute something like `[1|2] [2|3] [3|1]` or `[3|2] [2|1] [1|3]` or `[1|3] [3|2] [2|1]` etc, where the first and last numbers are the same. From ed13a7bb434a3c485417c69c98b8b5d334b7e949 Mon Sep 17 00:00:00 2001 From: Andrew Kvalheim Date: Mon, 10 Sep 2018 17:02:12 -0700 Subject: [PATCH 3/3] simple-cipher: Fix misspellings --- exercises/simple-cipher/description.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/exercises/simple-cipher/description.md b/exercises/simple-cipher/description.md index be6884946a..ea4fb9aded 100644 --- a/exercises/simple-cipher/description.md +++ b/exercises/simple-cipher/description.md @@ -11,8 +11,8 @@ for A, and so with the others." Ciphers are very straight-forward algorithms that allow us to render text less readable while still allowing easy deciphering. They are -vulnerable to many forms of cryptoanalysis, but we are lucky that -generally our little sisters are not cryptoanalysts. +vulnerable to many forms of cryptanalysis, but we are lucky that +generally our little sisters are not cryptanalysts. The Caesar Cipher was used for some messages from Julius Caesar that were sent afield. Now Caesar knew that the cipher wasn't very good, but