Improve formatting

Author: hb20007

advent-of-code/2015/README.md

@@ -24,4 +24,4 @@ Each puzzle grants one star. Good luck!
 - [Day 11: Corporate Policy](day-11/)
 - [Day 12: JSAbacusFramework.io](day-12/)
 - [Day 13: Knights of the Dinner Table](day-13/)
-- [Day 14: Reindeer Olympics](day-14/)
+- [Day 14: Reindeer Olympics](day-14/)

advent-of-code/2016/README.md

@@ -11,4 +11,4 @@ Collect stars by solving puzzles. Two puzzles will be made available on each day
 - [Day 1: No Time for a Taxicab](day-01/)
 - [Day 2: Bathroom Security](day-02/)
 - [Day 3: Squares With Three Sides](day-03/)
-- [Day 4: Security Through Obscurity](day-04/)
+- [Day 4: Security Through Obscurity](day-04/)

advent-of-code/2016/day-01/README.md

@@ -20,4 +20,4 @@ Then, you notice the instructions continue on the back of the Recruiting Documen
 
 For example, if your instructions are `R8, R4, R4, R8`, the first location you visit twice is `4` blocks away, due East.
 
-How many blocks away is the **first location you visit twice**?
+How many blocks away is the **first location you visit twice**?

advent-of-code/2016/day-02/README.md

@@ -53,4 +53,4 @@ You still start at "5" and stop when you're at an edge, but given the same instr
 
 So, given the actual keypad layout, the code would be `5DB3`.
 
-Using the same instructions in your puzzle input, what is the correct **bathroom code**?
+Using the same instructions in your puzzle input, what is the correct **bathroom code**?

advent-of-code/2016/day-03/README.md

@@ -25,4 +25,4 @@ For example, given the following specification, numbers with the same hundreds d
 203 403 603
 ```
 
-In your puzzle input, and instead reading by columns, **how many** of the listed triangles are **possible**?
+In your puzzle input, and instead reading by columns, **how many** of the listed triangles are **possible**?

advent-of-code/2016/day-04/README.md

@@ -25,4 +25,4 @@ To decrypt a room name, rotate each letter forward through the alphabet a number
 
 For example, the real name for `qzmt-zixmtkozy-ivhz-343` is `very encrypted name`.
 
-**What is the sector ID** of the room where North Pole objects are stored?
+**What is the sector ID** of the room where North Pole objects are stored?

advent-of-code/2017/README.md

@@ -15,4 +15,4 @@ Collect stars by solving puzzles. Two puzzles will be made available on each day
 - [Day 3: Spiral Memory](day-03/)
 - [Day 4: High-Entropy Passphrases](day-04/)
 - [Day 5: A Maze of Twisty Trampolines, All Alike](day-05/)
-- [Day 6: Memory Reallocation](day-06/)
+- [Day 6: Memory Reallocation](day-06/)

advent-of-code/2017/day-04/README.md

@@ -24,4 +24,4 @@ For example:
 - `iiii oiii ooii oooi oooo` is valid.
 - `oiii ioii iioi iiio` is not valid - any of these words can be rearranged to form any other word.
 
-Under this new system policy, how many passphrases are valid?
+Under this new system policy, how many passphrases are valid?

advent-of-code/2017/day-06/README.md

@@ -27,4 +27,4 @@ Out of curiosity, the debugger would also like to know the size of the loop: sta
 
 In the example above, `2 4 1 2` is seen again after four cycles, and so the answer in that example would be `4`.
 
-How many cycles are in the infinite loop that arises from the configuration in your puzzle input?
+How many cycles are in the infinite loop that arises from the configuration in your puzzle input?

advent-of-code/2018/README.md

@@ -20,4 +20,4 @@ Collect stars by solving puzzles. Two puzzles will be made available on each day
 - [Day 6: Chronal Coordinates](day-06/)
 - [Day 7: The Sum of Its Parts](day-07/)
 - [Day 8: Memory Maneuver](day-08/)
-- [Day 9: Marble Mania](day-09/)
+- [Day 9: Marble Mania](day-09/)

advent-of-code/2018/day-01/README.md

@@ -42,4 +42,4 @@ Here are other examples:
 - `-6, +3, +8, +5, -6` first reaches `5` twice.
 - `+7, +7, -2, -7, -4` first reaches `14` twice.
 
-**What is the first frequency your device reaches twice?**
+**What is the first frequency your device reaches twice?**

advent-of-code/2018/day-02/README.md

@@ -42,4 +42,4 @@ wvxyz
 
 The IDs `abcde` and `axcye` are close, but they differ by two characters (the second and fourth). However, the IDs `fghij` and `fguij` differ by exactly one character, the third (`h` and `u`). Those must be the correct boxes.
 
-**What letters are common between the two correct box IDs?** (In the example above, this is found by removing the differing character from either ID, producing `fgij`.)
+**What letters are common between the two correct box IDs?** (In the example above, this is found by removing the differing character from either ID, producing `fgij`.)

advent-of-code/2018/day-03/README.md

@@ -56,4 +56,4 @@ Amidst the chaos, you notice that exactly one claim doesn't overlap by even a si
 
 For example, in the claims above, only claim `3` is intact after all claims are made.
 
-**What is the ID of the only claim that doesn't overlap?**
+**What is the ID of the only claim that doesn't overlap?**

advent-of-code/2018/day-04/README.md

@@ -61,4 +61,4 @@ While this example listed the entries in chronological order, your entries are i
 
 In the example above, Guard #**99** spent minute **45** asleep more than any other guard or minute - three times in total. (In all other cases, any guard spent any minute asleep at most twice.)
 
-**What is the ID of the guard you chose multiplied by the minute you chose?** (In the above example, the answer would be `99 * 45 = 4455`.)
+**What is the ID of the guard you chose multiplied by the minute you chose?** (In the above example, the answer would be `99 * 45 = 4455`.)

advent-of-code/2018/day-05/README.md

@@ -41,4 +41,4 @@ For example, again using the polymer `dabAcCaCBAcCcaDA` from above:
 
 In this example, removing all `C`/`c` units was best, producing the answer **4**.
 
-**What is the length of the shortest polymer you can produce** by removing all units of exactly one type and fully reacting the result?
+**What is the length of the shortest polymer you can produce** by removing all units of exactly one type and fully reacting the result?

advent-of-code/2018/day-06/README.md

@@ -92,4 +92,4 @@ This region, which also includes coordinates D and E, has a total size of **16**
 
 Your actual region will need to be much larger than this example, though, instead including all locations with a total distance of less than **10000**.
 
-**What is the size of the region containing all locations which have a total distance to all given coordinates of less than 10000?**
+**What is the size of the region containing all locations which have a total distance to all given coordinates of less than 10000?**

advent-of-code/2018/day-07/README.md

@@ -77,4 +77,4 @@ Note that the order of the steps has changed; this is because steps now take tim
 
 In this example, it would take **15** seconds for two workers to complete these steps.
 
-With **5** workers and the **60+ second** step durations described above, **how long will it take to complete all of the steps?**
+With **5** workers and the **60+ second** step durations described above, **how long will it take to complete all of the steps?**

advent-of-code/2018/day-08/README.md

@@ -53,4 +53,4 @@ For example, again using the above nodes:
 
 So, in this example, the value of the root node is `66`.
 
-**What is the value of the root node?**
+**What is the value of the root node?**

advent-of-code/2018/day-09/README.md

@@ -57,4 +57,4 @@ Here are a few more examples:
 
 Amused by the speed of your answer, the Elves are curious:
 
-**What would the new winning Elf's score be if the number of the last marble were 100 times larger?**
+**What would the new winning Elf's score be if the number of the last marble were 100 times larger?**

advent-of-code/README.md

@@ -9,4 +9,4 @@
 | [2015](2015/) | **14** / 25 |
 | [2016](2016/) | **4** / 25 |
 | [2017](2017/) | **6** / 25 |
-| [2018](2018/) | **9** / 25 |
+| [2018](2018/) | **9** / 25 |

leetcode/06-zigzag-conversion.py

@@ -67,4 +67,4 @@ def convert(self, s, numRows):
         for row in zig_zag_rows_array:
             ans += row
 
-        return ans
+        return ans

leetcode/07-reverse-integer.py

@@ -36,4 +36,4 @@ def reverse(self, x):
         # SOLUTION 3: CODE GOLF
         # Runtime: 56ms
         n = ((x > 0) - (x < 0)) * int(str(abs(x))[::-1])
-        return n if n.bit_length() < 32 else 0
+        return n if n.bit_length() < 32 else 0

leetcode/10-regular-expression-matching.py

@@ -61,4 +61,4 @@ def dp(i, j):       #  Because calls will only ever be made to match(text[i:], p
                 else:
                     dp[i][j] = first_match and dp[i + 1][j + 1]
 
-        return dp[0][0]
+        return dp[0][0]

leetcode/README.md

@@ -14,4 +14,4 @@ My solutions to the problems on https://leetcode.com/problemset/all/
 | 7 | [Reverse Integer](07-reverse-integer.py) | :star: |
 | 8 | [String to Integer (atoi)](08-string-to-integer-atoi.py) | :star::star: |
 | 9 | [Palindrome Number](09-palindrome-number.py) | :star: |
-| 10 | [Regular Expression Matching](10-regular-expression-matching.py) | :star::star::star: |
+| 10 | [Regular Expression Matching](10-regular-expression-matching.py) | :star::star::star: |