Apply suggestions from code review

Co-authored-by: BethanyG <BethanyG@users.noreply.github.com>

Author: Yrahcaz7

exercises/practice/reverse-string/.approaches/additional-approaches/content.md

@@ -23,7 +23,7 @@ def reverse(text):
         # Calculate the index start.
         location = index + seq_len + 1
 
-        # Prepend the byte segment to the output bytearray
+        # Prepend the byte segment to the output bytearray.
         output[-location:-index or None] = given[index:index + seq_len]
 
         # Increment the index count / slide the 'window'.

exercises/practice/reverse-string/.approaches/built-in-reversed/content.md

@@ -20,7 +20,7 @@ def reverse(text):
 This version uses `reversed()` to reverse a `range()` object rather than feed a `start`/`stop`/`step` to `range()` itself.
 It then uses the reverse `range` to iterate over the input string and concatenate each code point to a new `output` string.
 This has over-complicated `reversed()`, as it can be called directly on the input string with almost no overhead.
-This has also incurs the performance hit of repeated concatenation to the `output` string.
+This has also incured the performance hit of repeated concatenation to the `output` string.
 
 While this approach _looks_ as if it would be similar to the first, it is actually `O(n**2)` in time complexity due to string concatenation.
 It was also the slowest in benchmarks.

exercises/practice/reverse-string/.approaches/list-and-join/content.md

@@ -91,7 +91,7 @@ def reverse(text):
     return output.decode("utf-8")
 ```
 
-This variation is operationally the same as variations #2 and #3 above, except that it encodes the string to a `utf-8` [`bytearray`](https://docs.python.org/3/library/stdtypes.html#bytearray).
+This variation is operationally the same as variations #2 and #3 above, except that it encodes the string to a `utf-8` [`bytearray`][bytearray-docs].
 It then iterates over the `bytearray` to perform the swaps.
 Finally, the `bytearray` is decoded into a `utf-8` string to return the reversed word.
 This incurs overhead when encoding/decoding to and from the `bytearray`.
@@ -138,3 +138,4 @@ The [`timeit`][timeit] module docs have more details, and [note.nkmk.me][note_nk
 [note_nkmk_me]: https://note.nkmk.me/en/python-timeit-measure/
 [timeit]: https://docs.python.org/3/library/timeit.html#python-interface
 [approach-additional-approaches]: https://exercism.org/tracks/python/exercises/reverse-string/approaches/additional-approaches
+[bytearray-docs]: https://docs.python.org/3/library/stdtypes.html#bytearray

exercises/practice/reverse-string/.articles/performance/code/Benchmark.py

@@ -100,10 +100,10 @@ def reverse_map(text):
                'reversed builtin', 'map and join']
 labels = row_headers
 
-# Empty dataframe will be filled in one cell at a time later
+# Empty dataframe will be filled in one cell at a time later.
 df = pd.DataFrame(np.nan, index=row_headers, columns=col_headers)
 
-# Function List to Call When Timing
+# Function List to Call When Timing.
 functions = [reverse_slice, reverse_iterate_and_prepend, reverse_range, reverse_half_swap, reverse_list_reverse,
              reverse_reversed, reverse_map]