Sync practice exercise docs (#1456)

kytrinyx · web-flow · commit 773cb40399f7 · 2022-11-08T21:52:28.000+01:00
diff --git a/exercises/practice/affine-cipher/.docs/instructions.md b/exercises/practice/affine-cipher/.docs/instructions.md
@@ -6,7 +6,7 @@ The affine cipher is a type of monoalphabetic substitution cipher.
 Each character is mapped to its numeric equivalent, encrypted with a mathematical function and then converted to the letter relating to its new numeric value.
 Although all monoalphabetic ciphers are weak, the affine cipher is much stronger than the atbash cipher, because it has many more keys.
 
-[comment]: # ( monoalphabetic as spelled by Merriam-Webster, compare to polyalphabetic )
+[//]: # ( monoalphabetic as spelled by Merriam-Webster, compare to polyalphabetic )
 
 ## Encryption
 
diff --git a/exercises/practice/allergies/.docs/instructions.md b/exercises/practice/allergies/.docs/instructions.md
@@ -6,21 +6,21 @@ An allergy test produces a single numeric score which contains the information a
 
 The list of items (and their value) that were tested are:
 
-* eggs (1)
-* peanuts (2)
-* shellfish (4)
-* strawberries (8)
-* tomatoes (16)
-* chocolate (32)
-* pollen (64)
-* cats (128)
+- eggs (1)
+- peanuts (2)
+- shellfish (4)
+- strawberries (8)
+- tomatoes (16)
+- chocolate (32)
+- pollen (64)
+- cats (128)
 
 So if Tom is allergic to peanuts and chocolate, he gets a score of 34.
 
 Now, given just that score of 34, your program should be able to say:
 
-* Whether Tom is allergic to any one of those allergens listed above.
-* All the allergens Tom is allergic to.
+- Whether Tom is allergic to any one of those allergens listed above.
+- All the allergens Tom is allergic to.
 
 Note: a given score may include allergens **not** listed above (i.e.  allergens that score 256, 512, 1024, etc.).
 Your program should ignore those components of the score.
diff --git a/exercises/practice/bowling/.docs/instructions.md b/exercises/practice/bowling/.docs/instructions.md
@@ -11,13 +11,13 @@ The game consists of 10 frames.
 A frame is composed of one or two ball throws with 10 pins standing at frame initialization.
 There are three cases for the tabulation of a frame.
 
-* An open frame is where a score of less than 10 is recorded for the frame.
+- An open frame is where a score of less than 10 is recorded for the frame.
   In this case the score for the frame is the number of pins knocked down.
 
-* A spare is where all ten pins are knocked down by the second throw.
+- A spare is where all ten pins are knocked down by the second throw.
   The total value of a spare is 10 plus the number of pins knocked down in their next throw.
 
-* A strike is where all ten pins are knocked down by the first throw.
+- A strike is where all ten pins are knocked down by the first throw.
   The total value of a strike is 10 plus the number of pins knocked down in the next two throws.
   If a strike is immediately followed by a second strike, then the value of the first strike cannot be determined until the ball is thrown one more time.
 
@@ -50,7 +50,7 @@ For a tenth frame of XXX (three strikes), the total value is 30.
 Write code to keep track of the score of a game of bowling.
 It should support two operations:
 
-* `roll(pins : int)` is called each time the player rolls a ball.
+- `roll(pins : int)` is called each time the player rolls a ball.
   The argument is the number of pins knocked down.
-* `score() : int` is called only at the very end of the game.
+- `score() : int` is called only at the very end of the game.
   It returns the total score for that game.
diff --git a/exercises/practice/darts/.docs/instructions.md b/exercises/practice/darts/.docs/instructions.md
@@ -6,10 +6,10 @@ Write a function that returns the earned points in a single toss of a Darts game
 
 In our particular instance of the game, the target rewards 4 different amounts of points, depending on where the dart lands:
 
-* If the dart lands outside the target, player earns no points (0 points).
-* If the dart lands in the outer circle of the target, player earns 1 point.
-* If the dart lands in the middle circle of the target, player earns 5 points.
-* If the dart lands in the inner circle of the target, player earns 10 points.
+- If the dart lands outside the target, player earns no points (0 points).
+- If the dart lands in the outer circle of the target, player earns 1 point.
+- If the dart lands in the middle circle of the target, player earns 5 points.
+- If the dart lands in the inner circle of the target, player earns 10 points.
 
 The outer circle has a radius of 10 units (this is equivalent to the total radius for the entire target), the middle circle a radius of 5 units, and the inner circle a radius of 1.
 Of course, they are all centered at the same point (that is, the circles are [concentric][] defined by the coordinates (0, 0).
@@ -18,6 +18,6 @@ Write a function that given a point in the target (defined by its [Cartesian coo
 
 [darts]: https://en.wikipedia.org/wiki/Darts
 [darts-target]: https://en.wikipedia.org/wiki/Darts#/media/File:Darts_in_a_dartboard.jpg
-[concentric]: http://mathworld.wolfram.com/ConcentricCircles.html
+[concentric]: https://mathworld.wolfram.com/ConcentricCircles.html
 [cartesian-coordinates]: https://www.mathsisfun.com/data/cartesian-coordinates.html
 [real-numbers]: https://www.mathsisfun.com/numbers/real-numbers.html
diff --git a/exercises/practice/diamond/.docs/instructions.md b/exercises/practice/diamond/.docs/instructions.md
@@ -5,17 +5,17 @@ Given a letter, it prints a diamond starting with 'A', with the supplied letter
 
 ## Requirements
 
-* The first row contains one 'A'.
-* The last row contains one 'A'.
-* All rows, except the first and last, have exactly two identical letters.
-* All rows have as many trailing spaces as leading spaces. (This might be 0).
-* The diamond is horizontally symmetric.
-* The diamond is vertically symmetric.
-* The diamond has a square shape (width equals height).
-* The letters form a diamond shape.
-* The top half has the letters in ascending order.
-* The bottom half has the letters in descending order.
-* The four corners (containing the spaces) are triangles.
+- The first row contains one 'A'.
+- The last row contains one 'A'.
+- All rows, except the first and last, have exactly two identical letters.
+- All rows have as many trailing spaces as leading spaces. (This might be 0).
+- The diamond is horizontally symmetric.
+- The diamond is vertically symmetric.
+- The diamond has a square shape (width equals height).
+- The letters form a diamond shape.
+- The top half has the letters in ascending order.
+- The bottom half has the letters in descending order.
+- The four corners (containing the spaces) are triangles.
 
 ## Examples
 
diff --git a/exercises/practice/food-chain/.docs/instructions.md b/exercises/practice/food-chain/.docs/instructions.md
@@ -61,4 +61,4 @@ I know an old lady who swallowed a horse.
 She's dead, of course!
 ```
 
-[cumulative-song]: http://en.wikipedia.org/wiki/Cumulative_song
+[cumulative-song]: https://en.wikipedia.org/wiki/Cumulative_song
diff --git a/exercises/practice/grep/.docs/instructions.md b/exercises/practice/grep/.docs/instructions.md
@@ -76,4 +76,4 @@ The `grep` command should support multiple flags at once.
 For example, running `grep -l -v "hello" file1.txt file2.txt` should
 print the names of files that do not contain the string "hello".
 
-[grep]: http://pubs.opengroup.org/onlinepubs/9699919799/utilities/grep.html
+[grep]: https://pubs.opengroup.org/onlinepubs/9699919799/utilities/grep.html
diff --git a/exercises/practice/hello-world/.docs/instructions.md b/exercises/practice/hello-world/.docs/instructions.md
@@ -13,4 +13,4 @@ The objectives are simple:
 
 If everything goes well, you will be ready to fetch your first real exercise.
 
-[hello-world]: http://en.wikipedia.org/wiki/%22Hello,_world!%22_program
+[hello-world]: https://en.wikipedia.org/wiki/%22Hello,_world!%22_program
diff --git a/exercises/practice/house/.docs/instructions.md b/exercises/practice/house/.docs/instructions.md
@@ -102,4 +102,4 @@ that ate the malt
 that lay in the house that Jack built.
 ```
 
-[papyr]: http://papyr.com/hypertextbooks/grammar/ph_noun.htm
+[papyr]: https://papyr.com/hypertextbooks/grammar/ph_noun.htm
diff --git a/exercises/practice/leap/.docs/instructions.md b/exercises/practice/leap/.docs/instructions.md
@@ -19,4 +19,4 @@ Though our exercise adopts some very simple rules, there is more to learn!
 
 For a delightful, four minute explanation of the whole leap year phenomenon, go watch [this youtube video][video].
 
-[video]: http://www.youtube.com/watch?v=xX96xng7sAE
+[video]: https://www.youtube.com/watch?v=xX96xng7sAE
diff --git a/exercises/practice/linked-list/.docs/instructions.md b/exercises/practice/linked-list/.docs/instructions.md
@@ -2,27 +2,25 @@
 
 Implement a doubly linked list.
 
-Like an array, a linked list is a simple linear data structure. Several
-common data types can be implemented using linked lists, like queues,
-stacks, and associative arrays.
-
-A linked list is a collection of data elements called *nodes*. In a
-*singly linked list* each node holds a value and a link to the next node.
-In a *doubly linked list* each node also holds a link to the previous
-node.
-
-You will write an implementation of a doubly linked list. Implement a
-Node to hold a value and pointers to the next and previous nodes. Then
-implement a List which holds references to the first and last node and
-offers an array-like interface for adding and removing items:
-
-* `push` (*insert value at back*);
-* `pop` (*remove value at back*);
-* `shift` (*remove value at front*).
-* `unshift` (*insert value at front*);
-
-To keep your implementation simple, the tests will not cover error
-conditions. Specifically: `pop` or `shift` will never be called on an
-empty list.
-
-If you want to know more about linked lists, check [Wikipedia](https://en.wikipedia.org/wiki/Linked_list).
+Like an array, a linked list is a simple linear data structure.
+Several common data types can be implemented using linked lists, like queues, stacks, and associative arrays.
+
+A linked list is a collection of data elements called *nodes*.
+In a *singly linked list* each node holds a value and a link to the next node.
+In a *doubly linked list* each node also holds a link to the previous node.
+
+You will write an implementation of a doubly linked list.
+Implement a Node to hold a value and pointers to the next and previous nodes.
+Then implement a List which holds references to the first and last node and offers an array-like interface for adding and removing items:
+
+- `push` (*insert value at back*);
+- `pop` (*remove value at back*);
+- `shift` (*remove value at front*).
+- `unshift` (*insert value at front*);
+
+To keep your implementation simple, the tests will not cover error conditions.
+Specifically: `pop` or `shift` will never be called on an empty list.
+
+Read more about [linked lists on Wikipedia][linked-lists].
+
+[linked-lists]: https://en.wikipedia.org/wiki/Linked_list
diff --git a/exercises/practice/list-ops/.docs/instructions.md b/exercises/practice/list-ops/.docs/instructions.md
@@ -2,19 +2,16 @@
 
 Implement basic list operations.
 
-In functional languages list operations like `length`, `map`, and
-`reduce` are very common. Implement a series of basic list operations,
-without using existing functions.
+In functional languages list operations like `length`, `map`, and `reduce` are very common.
+Implement a series of basic list operations, without using existing functions.
 
-The precise number and names of the operations to be implemented will be
-track dependent to avoid conflicts with existing names, but the general
-operations you will implement include:
+The precise number and names of the operations to be implemented will be track dependent to avoid conflicts with existing names, but the general operations you will implement include:
 
-* `append` (*given two lists, add all items in the second list to the end of the first list*);
-* `concatenate` (*given a series of lists, combine all items in all lists into one flattened list*);
-* `filter` (*given a predicate and a list, return the list of all items for which `predicate(item)` is True*);
-* `length` (*given a list, return the total number of items within it*);
-* `map` (*given a function and a list, return the list of the results of applying `function(item)` on all items*);
-* `foldl` (*given a function, a list, and initial accumulator, fold (reduce) each item into the accumulator from the left using `function(accumulator, item)`*);
-* `foldr` (*given a function, a list, and an initial accumulator, fold (reduce) each item into the accumulator from the right using `function(item, accumulator)`*);
-* `reverse` (*given a list, return a list with all the original items, but in reversed order*);
+- `append` (*given two lists, add all items in the second list to the end of the first list*);
+- `concatenate` (*given a series of lists, combine all items in all lists into one flattened list*);
+- `filter` (*given a predicate and a list, return the list of all items for which `predicate(item)` is True*);
+- `length` (*given a list, return the total number of items within it*);
+- `map` (*given a function and a list, return the list of the results of applying `function(item)` on all items*);
+- `foldl` (*given a function, a list, and initial accumulator, fold (reduce) each item into the accumulator from the left using `function(accumulator, item)`*);
+- `foldr` (*given a function, a list, and an initial accumulator, fold (reduce) each item into the accumulator from the right using `function(item, accumulator)`*);
+- `reverse` (*given a list, return a list with all the original items, but in reversed order*);
diff --git a/exercises/practice/pig-latin/.docs/instructions.md b/exercises/practice/pig-latin/.docs/instructions.md
@@ -16,4 +16,4 @@ There are a few more rules for edge cases, and there are regional variants too.
 
 Read more about [Pig Latin on Wikipedia][pig-latin].
 
-[pig-latin]: http://en.wikipedia.org/wiki/Pig_latin
+[pig-latin]: https://en.wikipedia.org/wiki/Pig_latin
diff --git a/exercises/practice/protein-translation/.docs/instructions.md b/exercises/practice/protein-translation/.docs/instructions.md
@@ -42,4 +42,4 @@ UAA, UAG, UGA         | STOP
 
 Learn more about [protein translation on Wikipedia][protein-translation].
 
-[protein-translation]: http://en.wikipedia.org/wiki/Translation_(biology)
+[protein-translation]: https://en.wikipedia.org/wiki/Translation_(biology)
diff --git a/exercises/practice/resistor-color-duo/.docs/instructions.md b/exercises/practice/resistor-color-duo/.docs/instructions.md
@@ -3,8 +3,8 @@
 If you want to build something using a Raspberry Pi, you'll probably use _resistors_.
 For this exercise, you need to know two things about them:
 
-* Each resistor has a resistance value.
-* Resistors are small - so small in fact that if you printed the resistance value on them, it would be hard to read.
+- Each resistor has a resistance value.
+- Resistors are small - so small in fact that if you printed the resistance value on them, it would be hard to read.
 
 To get around this problem, manufacturers print color-coded bands onto the resistors to denote their resistance values.
 Each band has a position and a numeric value.
@@ -17,16 +17,16 @@ The program will take color names as input and output a two digit number, even i
 
 The band colors are encoded as follows:
 
-* Black: 0
-* Brown: 1
-* Red: 2
-* Orange: 3
-* Yellow: 4
-* Green: 5
-* Blue: 6
-* Violet: 7
-* Grey: 8
-* White: 9
+- Black: 0
+- Brown: 1
+- Red: 2
+- Orange: 3
+- Yellow: 4
+- Green: 5
+- Blue: 6
+- Violet: 7
+- Grey: 8
+- White: 9
 
 From the example above:
 brown-green should return 15
diff --git a/exercises/practice/rna-transcription/.docs/instructions.md b/exercises/practice/rna-transcription/.docs/instructions.md
@@ -10,7 +10,7 @@ The four nucleotides found in RNA are adenine (**A**), cytosine (**C**), guanine
 
 Given a DNA strand, its transcribed RNA strand is formed by replacing each nucleotide with its complement:
 
-* `G` -> `C`
-* `C` -> `G`
-* `T` -> `A`
-* `A` -> `U`
+- `G` -> `C`
+- `C` -> `G`
+- `T` -> `A`
+- `A` -> `U`
diff --git a/exercises/practice/simple-cipher/.docs/instructions.md b/exercises/practice/simple-cipher/.docs/instructions.md
@@ -63,4 +63,4 @@ If you want to go farther in this field, the questions begin to be about how we
 Take a look at [Diffie-Hellman on Wikipedia][dh] for one of the first implementations of this scheme.
 
 [img-caesar-cipher]: https://upload.wikimedia.org/wikipedia/commons/thumb/4/4a/Caesar_cipher_left_shift_of_3.svg/320px-Caesar_cipher_left_shift_of_3.svg.png
-[dh]: http://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange
+[dh]: https://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange
diff --git a/exercises/practice/space-age/.docs/instructions.md b/exercises/practice/space-age/.docs/instructions.md
@@ -16,4 +16,4 @@ be able to say that they're 31.69 Earth-years old.
 
 If you're wondering why Pluto didn't make the cut, go watch [this YouTube video][pluto-video].
 
-[pluto-video]: http://www.youtube.com/watch?v=Z_2gbGXzFbs
+[pluto-video]: https://www.youtube.com/watch?v=Z_2gbGXzFbs
diff --git a/exercises/practice/two-bucket/.docs/instructions.md b/exercises/practice/two-bucket/.docs/instructions.md
@@ -41,6 +41,6 @@ So your first action is to fill bucket one.
 You choose to empty bucket one for your second action.
 For your third action, you may not fill bucket two, because this violates the third rule -- you may not end up in a state after any action where the starting bucket is empty and the other bucket is full.
 
-Written with <3 at [Fullstack Academy][fulstack] by Lindsay Levine.
+Written with <3 at [Fullstack Academy][fullstack] by Lindsay Levine.
 
-[fullstack]: http://www.fullstackacademy.com/
+[fullstack]: https://www.fullstackacademy.com/
diff --git a/exercises/practice/wordy/.docs/instructions.md b/exercises/practice/wordy/.docs/instructions.md
@@ -54,6 +54,6 @@ Since these are verbal word problems, evaluate the expression from left-to-right
 
 The parser should reject:
 
-* Unsupported operations ("What is 52 cubed?")
-* Non-math questions ("Who is the President of the United States")
-* Word problems with invalid syntax ("What is 1 plus plus 2?")
+- Unsupported operations ("What is 52 cubed?")
+- Non-math questions ("Who is the President of the United States")
+- Word problems with invalid syntax ("What is 1 plus plus 2?")
diff --git a/exercises/practice/zipper/.docs/instructions.md b/exercises/practice/zipper/.docs/instructions.md
@@ -2,13 +2,10 @@
 
 Creating a zipper for a binary tree.
 
-[Zippers](https://en.wikipedia.org/wiki/Zipper_%28data_structure%29) are
-a purely functional way of navigating within a data structure and
-manipulating it.  They essentially contain a data structure and a
-pointer into that data structure (called the focus).
+[Zippers][zipper] are a purely functional way of navigating within a data structure and manipulating it.
+They essentially contain a data structure and a pointer into that data structure (called the focus).
 
-For example given a rose tree (where each node contains a value and a
-list of child nodes) a zipper might support these operations:
+For example given a rose tree (where each node contains a value and a list of child nodes) a zipper might support these operations:
 
 - `from_tree` (get a zipper out of a rose tree, the focus is on the root node)
 - `to_tree` (get the rose tree out of the zipper)
@@ -26,3 +23,5 @@ list of child nodes) a zipper might support these operations:
 - `delete` (removes the focus node and all subtrees, focus moves to the
   `next` node if possible otherwise to the `prev` node if possible,
   otherwise to the parent node, returns a new zipper)
+
+[zipper]: https://en.wikipedia.org/wiki/Zipper_%28data_structure%29

Original file line number	Diff line number	Diff line change
`@@ -13,4 +13,4 @@ The objectives are simple:`
`13`	`13`
`14`	`14`	`If everything goes well, you will be ready to fetch your first real exercise.`
`15`	`15`
`16`		`-[hello-world]: http://en.wikipedia.org/wiki/%22Hello,_world!%22_program`
	`16`	`+[hello-world]: https://en.wikipedia.org/wiki/%22Hello,_world!%22_program`
Original file line number	Diff line number	Diff line change
`@@ -19,4 +19,4 @@ Though our exercise adopts some very simple rules, there is more to learn!`
`19`	`19`
`20`	`20`	`For a delightful, four minute explanation of the whole leap year phenomenon, go watch [this youtube video][video].`
`21`	`21`
`22`		`-[video]: http://www.youtube.com/watch?v=xX96xng7sAE`
	`22`	`+[video]: https://www.youtube.com/watch?v=xX96xng7sAE`