Updated readmes

Author: javadev

src/main/python/g0001_0100/s0001_two_sum/readme.md

@@ -40,8 +40,6 @@ You can return the answer in any order.
 
 **Follow-up:** Can you come up with an algorithm that is less than <code>O(n<sup>2</sup>)</code> time complexity?
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0002_add_two_numbers/readme.md

@@ -37,8 +37,6 @@ You may assume the two numbers do not contain any leading zero, except the numbe
 *   `0 <= Node.val <= 9`
 *   It is guaranteed that the list represents a number that does not have leading zeros.
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md

@@ -42,8 +42,6 @@ Given a string `s`, find the length of the **longest substring** without repeati
 *   <code>0 <= s.length <= 5 * 10<sup>4</sup></code>
 *   `s` consists of English letters, digits, symbols and spaces.
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/readme.md

@@ -52,8 +52,6 @@ The overall run time complexity should be `O(log (m+n))`.
 *   `1 <= m + n <= 2000`
 *   <code>-10<sup>6</sup> <= nums1[i], nums2[i] <= 10<sup>6</sup></code>
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0005_longest_palindromic_substring/readme.md

@@ -36,8 +36,6 @@ Given a string `s`, return _the longest palindromic substring_ in `s`.
 *   `1 <= s.length <= 1000`
 *   `s` consist of only digits and English letters.
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0006_zigzag_conversion/readme.md

@@ -41,8 +41,6 @@ string convert(string s, int numRows);
 *   `s` consists of English letters (lower-case and upper-case), `','` and `'.'`.
 *   `1 <= numRows <= 1000`
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0007_reverse_integer/readme.md

@@ -37,8 +37,6 @@ Given a signed 32-bit integer `x`, return `x` _with its digits reversed_. If rev
 
 *   <code>-2<sup>31</sup> <= x <= 2<sup>31</sup> - 1</code>
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0008_string_to_integer_atoi/readme.md

@@ -115,8 +115,6 @@ Since -91283472332 is less than the lower bound of the range [-2<sup>31</sup>, 2
 *   `0 <= s.length <= 200`
 *   `s` consists of English letters (lower-case and upper-case), digits (`0-9`), `' '`, `'+'`, `'-'`, and `'.'`.
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0009_palindrome_number/readme.md

@@ -43,8 +43,6 @@ An integer is a **palindrome** when it reads the same backward as forward. For e
 
 **Follow up:** Could you solve it without converting the integer to a string?
 
-
-
 ## Solution
 
 ```python

src/main/python/g0001_0100/s0010_regular_expression_matching/readme.md

@@ -58,8 +58,6 @@ The matching should cover the **entire** input string (not partial).
 *   `p` contains only lowercase English letters, `'.'`, and `'*'`.
 *   It is guaranteed for each appearance of the character `'*'`, there will be a previous valid character to match.
 
-
-
 ## Solution
 
 ```python