Updates the README files for various exercises

config/patches/0003-Add-laziness-instructions-accumulate-readme.patch

@@ -1,13 +1,15 @@
 diff --git a/exercises/accumulate/README.md b/exercises/accumulate/README.md
-index 87f1fd1..12a25d4 100644
+index f9679c7..12a25d4 100644
 --- a/exercises/accumulate/README.md
 +++ b/exercises/accumulate/README.md
-@@ -35,7 +35,7 @@ To run the tests, run the command `dotnet test` from within the exercise directo
+@@ -33,6 +33,10 @@ This exercise requires you to write an extension method. For more information, s
 
- ### Laziness test
+ To run the tests, run the command `dotnet test` from within the exercise directory.
 
--Since `accumulate` returns an IEnumerable it's execution can be deferred until `ToList()` it is called on it and this is tested with the `Accumulate_is_lazy` method
++### Laziness test
++
 +Since `accumulate` returns an `IEnumerable`, it's execution is deferred until `ToList()` it is called on it, which is tested with the `Accumulate_is_lazy` method
- 
++
  ## Further information
 
+ For more detailed information about the C# track, including how to get help if

exercises/change/README.md

@@ -6,9 +6,9 @@ that the sum of the coins' value would equal the correct amount of change.
 ## For example
 
 - An input of 15 with [1, 5, 10, 25, 100] should return one nickel (5)
-  and one dime (10) or [0, 1, 1, 0, 0]
+  and one dime (10) or [5, 10]
 - An input of 40 with [1, 5, 10, 25, 100] should return one nickel (5)
-  and one dime (10) and one quarter (25) or [0, 1, 1, 1, 0]
+  and one dime (10) and one quarter (25) or [5, 10, 25]
 
 ## Edge cases
 

exercises/crypto-square/README.md

@@ -59,7 +59,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"

exercises/dominoes/README.md

@@ -4,8 +4,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.

exercises/rest-api/README.md

@@ -1,4 +1,4 @@
-# REST API
+# Rest Api
 
 Implement a RESTful API for tracking IOUs.
 
@@ -38,7 +38,6 @@ Your task is to implement a simple [RESTful API](https://en.wikipedia.org/wiki/R
 - Example RESTful APIs
   - [GitHub](https://developer.github.com/v3/)
   - [Reddit](https://www.reddit.com/dev/api/)
-
 ## Running the tests
 
 To run the tests, run the command `dotnet test` from within the exercise directory.

exercises/saddle-points/README.md

@@ -23,6 +23,8 @@ A matrix may have zero or more saddle points.
 Your code should be able to provide the (possibly empty) list of all the
 saddle points for any given matrix.
 
+The matrix can have a different number of rows and columns (Non square).
+
 Note that you may find other definitions of matrix saddle points online,
 but the tests for this exercise follow the above unambiguous definition.
 

exercises/simple-cipher/README.md

@@ -13,8 +13,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

exercises/two-fer/README.md

@@ -23,7 +23,7 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex
 
 ## Source
 
-[https://en.wikipedia.org/wiki/Two-fer](https://en.wikipedia.org/wiki/Two-fer)
+[https://github.com/exercism/problem-specifications/issues/757](https://github.com/exercism/problem-specifications/issues/757)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.