sync exercises (#320)

[no important files changed]

Author: keiravillekode

exercises/practice/intergalactic-transmission/.docs/instructions.md

@@ -7,7 +7,7 @@ Your job is to help implement
 
 A parity bit is simple way of detecting transmission errors.
 The transmitters and receivers can only transmit and receive _exactly_ eight bits at a time (including the parity bit).
-The parity bit is set so that there is an _even_ number 1s in each transmission and is always the first bit from the right.
+The parity bit is set so that there is an _even_ number of 1 bits in each transmission, and the parity bit is always the first bit from the right.
 So if the receiver receives `11000001`, `01110101` or `01000000` (i.e. a transmission with an odd number of 1 bits), it knows there is an error.
 
 However, messages are rarely this short, and need to be transmitted in a sequence when they are longer.
@@ -40,7 +40,7 @@ Their parity bits are set to 1 so that they have an even number of 1 bits in the
 They are transmitted as `01110001` and `00011011` (or `71` and `1B` in hex).
 
 The last transmission (`1110`) has only four bits of data.
-Since exactly eight bits are transmitted at a time and the parity bit is the right most bit, three 0 bits and then the parity bit are added to make up eight bits.
+Since exactly eight bits are transmitted at a time and the parity bit is the rightmost bit, three 0 bits and then the parity bit are added to make up eight bits.
 It now looks like this (where `_` is the parity bit):
 
 ```text

exercises/practice/luhn/.docs/instructions.md

@@ -41,7 +41,7 @@ If the sum is evenly divisible by 10, the original number is valid.
 
 ### Invalid Canadian SIN
 
-The number to be checked is `066 123 468`.
+The number to be checked is `066 123 478`.
 
 We start at the end of the number and double every second digit, beginning with the second digit from the right and moving left.
 

exercises/practice/reverse-string/.meta/tests.toml

@@ -26,3 +26,15 @@ description = "a palindrome"
 
 [b9e7dec1-c6df-40bd-9fa3-cd7ded010c4c]
 description = "an even-sized word"
+
+[1bed0f8a-13b0-4bd3-9d59-3d0593326fa2]
+description = "wide characters"
+include = false
+
+[93d7e1b8-f60f-4f3c-9559-4056e10d2ead]
+description = "grapheme cluster with pre-combined form"
+include = false
+
+[1028b2c1-6763-4459-8540-2da47ca512d9]
+description = "grapheme clusters"
+include = false