Fix formatting

Author: onixlas

arrays/169_Majority_Element/README.md

@@ -8,13 +8,13 @@ The majority element is the element that appears more than `⌊n / 2⌋` times.
 
 **Example 1:**
 
-Input: `nums = [3,2,3]`
-Output: `3`
+* Input: `nums = [3,2,3]`
+* Output: `3`
 
 **Example 2:**
 
-Input: `[2,2,1,1,1,2,2]`
-Output: `2`
+* Input: `[2,2,1,1,1,2,2]`
+* Output: `2`
 
 **Constraints:**
 

binary-tree/100_Same_Tree/README.md

@@ -7,16 +7,16 @@ Given the roots of two binary trees `p` and `q`, write a function to check if th
 Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
 
 **Example 1:**  
-Input: `p = [1,2,3], q = [1,2,3]`
-Output: `true`
+* Input: `p = [1,2,3], q = [1,2,3]`
+* Output: `true`
 
 **Example 2:**  
-Input: `p = [1,2], q = [1,null,2]`
-Output: `false`
+* Input: `p = [1,2], q = [1,null,2]`
+* Output: `false`
 
 **Example 3:**  
-Input: `p = [1,2,1], q = [1,1,2]`
-Output: `false`
+* Input: `p = [1,2,1], q = [1,1,2]`
+* Output: `false`
 
 **Constraints:**
 

hashmap/347_Top_K_Frequent_Elements/README.md

@@ -7,13 +7,13 @@ You may return the answer in any order.
 
 **Example 1:**
 
-Input: `nums = [1, 1, 1, 2, 2, 3], k = 2`
-Output: `[1, 2]`
+* Input: `nums = [1, 1, 1, 2, 2, 3], k = 2`
+* Output: `[1, 2]`
 
 **Example 2:**
 
-Input: `nums = [1], k = 1`
-Output: `[1]`
+* Input: `nums = [1], k = 1`
+* Output: `[1]`
 
 **Constraints:**
 

hashmap/383_Ransom_Note/README.md

@@ -8,18 +8,18 @@ Each letter in `magazine` can only be used once in `ransomNote`.
 
 **Example 1:**
 
-Input: `ransomNote = "a"`, `magazine = "b"`
-Output: `false`
+* Input: `ransomNote = "a"`, `magazine = "b"`
+* Output: `false`
 
 **Example 2:**
 
-Input: `ransomNote = "aa"`, `magazine = "ab"`
-Output: `false`
+* Input: `ransomNote = "aa"`, `magazine = "ab"`
+* Output: `false`
 
 **Example 3:**
 
-Input: `ransomNote = "aa"`, `magazine = "aab"`
-Output: ``true`
+* Input: `ransomNote = "aa"`, `magazine = "aab"`
+* Output: ``true`
 
 **Constraints:**
 

intervals/452_minimum_number_of_arrows_to_burst_baloons/README.md

@@ -19,25 +19,25 @@ to burst all balloons.
 
 **Example 1:**
 
-Input: `points = [[10,16],[2,8],[1,6],[7,12]]`
-Output: `2`
-Explanation: The balloons can be burst by 2 arrows:
-- Shoot an arrow at `x = 6`, bursting the balloons `[2,8]` and `[1,6]`.
-- Shoot an arrow at `x = 11`, bursting the balloons `[10,16]` and `[7,12]`.
+* Input: `points = [[10,16],[2,8],[1,6],[7,12]]`
+* Output: `2`
+* Explanation: The balloons can be burst by 2 arrows:
+  - Shoot an arrow at `x = 6`, bursting the balloons `[2,8]` and `[1,6]`.
+  - Shoot an arrow at `x = 11`, bursting the balloons `[10,16]` and `[7,12]`.
 
 **Example 2:**
 
-Input: `points = [[1,2],[3,4],[5,6],[7,8]]`
-Output: `4`
-Explanation: One arrow needs to be shot for each balloon for a total of `4` arrows.
+* Input: `points = [[1,2],[3,4],[5,6],[7,8]]`
+* Output: `4`
+* Explanation: One arrow needs to be shot for each balloon for a total of `4` arrows.
 
 **Example 3:**
 
-Input: `points = [[1,2],[2,3],[3,4],[4,5]]`
-Output: `2`
-Explanation: The balloons can be burst by 2 arrows:
-- Shoot an arrow at `x = 2`, bursting the balloons `[1,2]` and `[2,3]`.
-- Shoot an arrow at `x = 4`, bursting the balloons `[3,4]` and `[4,5]`.
+* Input: `points = [[1,2],[2,3],[3,4],[4,5]]`
+* Output: `2`
+* Explanation: The balloons can be burst by 2 arrows:
+  - Shoot an arrow at `x = 2`, bursting the balloons `[1,2]` and `[2,3]`.
+  - Shoot an arrow at `x = 4`, bursting the balloons `[3,4]` and `[4,5]`.
 
 **Constraints:**
 

prefix-product/238_Product_of_Array_Except_Self/README.md

@@ -13,13 +13,13 @@ without using the division operation.
 
 **Example 1:**
 
-Input: `nums = [1,2,3,4]`
-Output: `[24,12,8,6]`
+* Input: `nums = [1,2,3,4]`
+* Output: `[24,12,8,6]`
 
 **Example 2:**
 
-Input: `nums = [-1,1,0,-3,3]`
-Output: `[0,0,9,0,0]`
+* Input: `nums = [-1,1,0,-3,3]`
+* Output: `[0,0,9,0,0]`
 
 **Constraints:**
 

sliding-window/000_Max_Consecutive_Ones_Variant/README.md

@@ -6,15 +6,15 @@ Given a binary array nums, find the maximum length of a consecutive subarray con
 
 **Example 1:**  
 
-Input: `[0, 0]`  
-Output: `0`
-Explanation: Removing any element leaves `[0]` (no `1`s).
+* Input: `[0, 0]`  
+* Output: `0`
+* Explanation: Removing any element leaves `[0]` (no `1`s).
 
 **Example 2:**  
 
-Input: `[0, 1]`  
-Output: `1` 
-Explanation: Remove `0`: `[1]` → sequence of `1` has length `1`.
+* Input: `[0, 1]`  
+* Output: `1` 
+* Explanation: Remove `0`: `[1]` → sequence of `1` has length `1`.
 
 **Constraints:**
 

sliding-window/209_Minumum_Size_Subarray_Sum/README.md

@@ -8,19 +8,19 @@ If there is no such subarray, return `0` instead.
 
 **Example 1:**
 
-Input: `target = 7`, nums = `[2,3,1,2,4,3]`
-Output: `2`
-Explanation: The subarray `[4,3]` has the minimal length under the problem constraint.
+* Input: `target = 7`, nums = `[2,3,1,2,4,3]`
+* Output: `2`
+* Explanation: The subarray `[4,3]` has the minimal length under the problem constraint.
 
 **Example 2:**
 
-Input: `target = 4`, `nums = [1,4,4]`
-Output: `1`
+* Input: `target = 4`, `nums = [1,4,4]`
+* Output: `1`
 
 **Example 3:**
 
-Input: `target = 11`, `nums = [1,1,1,1,1,1,1,1]`
-Output: `0`
+* Input: `target = 11`, `nums = [1,1,1,1,1,1,1,1]`
+* Output: `0`
 
 Constraints:
 

two-pointers/125_Valid_Palindrome/README.md

@@ -6,14 +6,14 @@ A phrase is a palindrome if, after converting all uppercase letters into lowerca
 Given a string `s`, return `True` if it is a palindrome, or `False` otherwise.
 
 **Example 1:**  
-Input: `s = "A man, a plan, a canal: Panama"`  
-Output: `true`  
-Explanation: "amanaplanacanalpanama" is a valid palindrome.
+* Input: `s = "A man, a plan, a canal: Panama"`  
+* Output: `true`  
+* Explanation: "amanaplanacanalpanama" is a valid palindrome.
 
 **Example 2:**  
-Input: `s = "race a car"`  
-Output: `false`  
-Explanation: "raceacar" is not a palindrome.
+* Input: `s = "race a car"`  
+* Output: `false`  
+* Explanation: "raceacar" is not a palindrome.
 
 ## Solutions
 

two-pointers/392_Is_Subsequence/README.md

@@ -8,13 +8,13 @@ A subsequence of a string is a new string that is formed from the original strin
 
 **Example 1:**
 
-Input: `s = "abc"`, `t = "ahbgdc"`
-Output: `true`
+* Input: `s = "abc"`, `t = "ahbgdc"`
+* Output: `true`
 
 **Example 2:**
 
-Input: `s = "axc"`, `t = "ahbgdc"`
-Output: `false`
+* Input: `s = "axc"`, `t = "ahbgdc"`
+* Output: `false`
 
 **Constraints:**