Make docs more consistent

exercises/practice/acronym/.docs/instructions.append.md

@@ -1,5 +1,7 @@
+# Instruction append
+
 ## Reserved Addresses
 
-The buffer for the input string uses bytes 64 - 196 of linear memory.
+The buffer for the input string uses bytes 64-196 of linear memory.
 
-You may modify this buffer in place if you wish to avoid additional memory allocations
+You may modify this buffer in place if you wish to avoid additional memory allocations.

exercises/practice/all-your-base/.docs/instructions.append.md

@@ -1,3 +1,5 @@
+# Instruction append
+
 ## Reserved Addresses
 
 All input is provided as parameters, so no addresses in the linear memory are reserved.

exercises/practice/armstrong-numbers/.docs/instructions.append.md

@@ -1,3 +1,5 @@
+# Instruction append
+
 ## Reserved Addresses
 
-No linear memory is requires for this exercise.
+No linear memory is required for this exercise.

exercises/practice/circular-buffer/.docs/hints.md

@@ -0,0 +1,3 @@
+# Hints
+
+Linear memory is byte-addressable, but `i32` has a width of four bytes.

exercises/practice/circular-buffer/.docs/instructions.append.md

@@ -1,5 +1,3 @@
-# Instructions
+# Instructions append
 
 The `read` returns a Go-style error handling type `(i32,i32)`
-
-Hint: Linear Memory is byte-addressable, but `i32` has a width of four bytes

exercises/practice/collatz-conjecture/.docs/instructions.append.md

@@ -1,3 +1,3 @@
 # Instructions append
 
-If `n` is not a positive integer, stop the program from being executed further and return -1 indicating an error condition.
+If `n` is _not_ a positive integer, don't continue executing and return `-1` to indicate an error condition.

exercises/practice/hamming/.docs/instructions.append.md

@@ -1,6 +1,8 @@
+# Instruction append
+
 ## Reserved Addresses
 
 The buffer for the first string uses bytes 1024-2047 of linear memory.
 The buffer for the second string uses bytes 2048-3075 of linear memory.
 
-You should not have to modify these buffer or allocate additional memory
+You should not have to modify these buffers or allocate additional memory.

exercises/practice/nucleotide-count/.docs/instructions.append.md

@@ -2,9 +2,8 @@
 
 ## Reserved Memory
 
-Bytes 64-319 of the linear memory are reserved for the input string.
+The buffer for the input string uses bytes 64-319 of linear memory.
 
 ## Results
 
-The result should be returned as a 4-way tuple (i32 i32 i32 i32)
-Each number represents the count for A, C, G and T in this order.
+The result should be returned as a 4-way tuple: `(i32 i32 i32 i32)`. Each number represents the count for the letters `A`, `C`, `G`and `T`, in this order.

exercises/practice/pangram/.docs/instructions.append.md

@@ -1,3 +1,5 @@
+# Instruction append
+
 ## Reserved Memory
 
-Bytes 64-319 of the linear memory are reserved for the input string.
+The buffer for the input string uses bytes 64-319 of linear memory.

exercises/practice/pop-count/.docs/instructions.append.md

@@ -1,3 +1,5 @@
+# Instruction append
+
 ## Reserved Addresses
 
 No linear memory is required for this exercise.

exercises/practice/resistor-color/.docs/instructions.append.md

@@ -1,10 +1,12 @@
+# Instructions append
+
 ## Reserved Memory
 
-Bytes 64-189 of the linear memory are reserved for the input string.
+The buffer for the input string uses bytes 64-189 of linear memory.
 
-# Instructions append
+## Arrays
 
-WebAssembly does not have the concept of arrays. For the colors test, return a comma-delimited buffer of characters in the form:
-`black,brown,red,orange,yellow,green,blue,violet,grey,white`
+WebAssembly does not have the concept of arrays.
+For the colors test, return a comma-delimited buffer of characters in the form: `black,brown,red,orange,yellow,green,blue,violet,grey,white`
 
 You will then have to internally build an array of structures using offsets and lengths to provide structure around this buffer.

exercises/practice/reverse-string/.docs/instructions.append.md

@@ -1,5 +1,5 @@
 ## Reserved Memory
 
-Bytes 64-319 of the linear memory are reserved for the input string.
+The buffer for the input string uses bytes 64-319 of linear memory.
 
 The input string can be modified in place if desired.

exercises/practice/rna-transcription/.docs/instructions.append.md

@@ -1,5 +1,7 @@
+# Instruction append
+
 ## Reserved Memory
 
-Bytes 64-189 of the linear memory are reserved for the input string.
+The buffer for the input string uses bytes 64-189 of linear memory.
 
 The input string can be modified in place if desired.

exercises/practice/square-root/.docs/instructions.append.md

@@ -1,3 +1,5 @@
+# Instruction append
+
 ## Reserved Addresses
 
 No linear memory is required for this exercise.

exercises/practice/two-fer/.docs/instructions.append.md

@@ -1,3 +1,5 @@
+# Instruction append
+
 ## Reserved Addresses
 
-The input buffer for the first string uses bytes 128-192 linear memory.
+The buffer for the input string uses bytes 128-192 of linear memory.