Clean up description.md files.

mbucko · mbucko · commit e615b470e541 · 2024-03-13T17:46:25.000+01:00
diff --git a/data/problems/LongestSubstringWithoutRepeatingCharacters/description.md b/data/problems/LongestSubstringWithoutRepeatingCharacters/description.md
@@ -1,29 +1,25 @@
 # Longest Substring Without Repeating Characters
 
 Given a string `s`, find the length of the longest substring that has no repeating characters.
-
-
-**Example 1:**\
+\
+\
+\
+**Example 1:**
 >**Input:** s = "abcabcbb"\
 >**Output:** 3\
 >**Explanation:** The answer is "abc", with the length of 3.
 
-
-
-**Example 2:**\
+**Example 2:**
 >**Input:** s = "bbbbb"\
 >**Output:** 1\
 >**Explanation:** The answer is "b", with the length of 1.
 
-
-
-**Example 3:**\
+**Example 3:**
 >**Input:** s = "pwwkew"\
 >**Output:** 3\
 >**Explanation:** The answer is "wke", with the length of 3.\
 >Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
  
-
 **Constraints:**
 
 * ``0 <= s.length <= 5 * 104``
diff --git a/data/problems/TwoSum/description.md b/data/problems/TwoSum/description.md
@@ -14,23 +14,19 @@ You can return the answer in any order.
 >**Output:** [0,1]\
 >**Explanation:** Because nums[0] + nums[1] == 10, we return [0, 1].
 
-
 **Example 2:**
 
 >**Input:** nums = [1,3,4], target = 7\
 >**Output:** [1,2]
 
-
-
 **Example 3:**
 
 >**Input:** nums = [1,1], target = 2\
 >**Output:** [0,1]
- 
 
 **Constraints:**
 
 * ``2 <= nums.length <= 104``
 * ``-109 <= nums[i] <= 109``
 * ``-109 <= target <= 109``
-* **Only one valid answer exists.**
+* **Only one valid answer exists.**
