Removed escape for square brackets.

Author: javadev

src.save/main/java/g0001_0100/s0001_two_sum/readme.md

@@ -10,23 +10,23 @@ You can return the answer in any order.
 
 **Example 1:**
 
-**Input:** nums = \[2,7,11,15\], target = 9
+**Input:** nums = [2,7,11,15], target = 9
 
-**Output:** \[0,1\]
+**Output:** [0,1]
 
-**Output:** Because nums\[0\] + nums\[1\] == 9, we return \[0, 1\]. 
+**Output:** Because nums[0] + nums[1] == 9, we return [0, 1]. 
 
 **Example 2:**
 
-**Input:** nums = \[3,2,4\], target = 6
+**Input:** nums = [3,2,4], target = 6
 
-**Output:** \[1,2\] 
+**Output:** [1,2] 
 
 **Example 3:**
 
-**Input:** nums = \[3,3\], target = 6
+**Input:** nums = [3,3], target = 6
 
-**Output:** \[0,1\] 
+**Output:** [0,1] 
 
 **Constraints:**
 

src.save/main/java/g0001_0100/s0002_add_two_numbers/readme.md

@@ -10,23 +10,23 @@ You may assume the two numbers do not contain any leading zero, except the numbe
 
 ![](https://assets.leetcode.com/uploads/2020/10/02/addtwonumber1.jpg)
 
-**Input:** l1 = \[2,4,3\], l2 = \[5,6,4\]
+**Input:** l1 = [2,4,3], l2 = [5,6,4]
 
-**Output:** \[7,0,8\]
+**Output:** [7,0,8]
 
 **Explanation:** 342 + 465 = 807. 
 
 **Example 2:**
 
-**Input:** l1 = \[0\], l2 = \[0\]
+**Input:** l1 = [0], l2 = [0]
 
-**Output:** \[0\] 
+**Output:** [0] 
 
 **Example 3:**
 
-**Input:** l1 = \[9,9,9,9,9,9,9\], l2 = \[9,9,9,9\]
+**Input:** l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
 
-**Output:** \[8,9,9,9,0,0,0,1\] 
+**Output:** [8,9,9,9,0,0,0,1] 
 
 **Constraints:**
 

src.save/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/readme.md

@@ -8,35 +8,35 @@ The overall run time complexity should be `O(log (m+n))`.
 
 **Example 1:**
 
-**Input:** nums1 = \[1,3\], nums2 = \[2\]
+**Input:** nums1 = [1,3], nums2 = [2]
 
 **Output:** 2.00000
 
-**Explanation:** merged array = \[1,2,3\] and median is 2. 
+**Explanation:** merged array = [1,2,3] and median is 2. 
 
 **Example 2:**
 
-**Input:** nums1 = \[1,2\], nums2 = \[3,4\]
+**Input:** nums1 = [1,2], nums2 = [3,4]
 
 **Output:** 2.50000
 
-**Explanation:** merged array = \[1,2,3,4\] and median is (2 + 3) / 2 = 2.5. 
+**Explanation:** merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5. 
 
 **Example 3:**
 
-**Input:** nums1 = \[0,0\], nums2 = \[0,0\]
+**Input:** nums1 = [0,0], nums2 = [0,0]
 
 **Output:** 0.00000 
 
 **Example 4:**
 
-**Input:** nums1 = \[\], nums2 = \[1\]
+**Input:** nums1 = [], nums2 = [1]
 
 **Output:** 1.00000 
 
 **Example 5:**
 
-**Input:** nums1 = \[2\], nums2 = \[\]
+**Input:** nums1 = [2], nums2 = []
 
 **Output:** 2.00000 
 

src.save/main/java/g0001_0100/s0008_string_to_integer_atoi/readme.md

@@ -33,7 +33,7 @@ The algorithm for `myAtoi(string s)` is as follows:
     Step 3: "42" ("42" is read in)
                ^
 
-The parsed integer is 42. Since 42 is in the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final result is 42. 
+The parsed integer is 42. Since 42 is in the range [-2<sup>31</sup>, 2<sup>31</sup> - 1], the final result is 42. 
 
 **Example 2:**
 
@@ -51,7 +51,7 @@ The parsed integer is 42. Since 42 is in the range \[-2<sup>31</sup>, 2<sup>31</
                  ^
     The parsed integer is -42.
 
-Since -42 is in the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final result is -42. 
+Since -42 is in the range [-2<sup>31</sup>, 2<sup>31</sup> - 1], the final result is -42. 
 
 **Example 3:**
 
@@ -69,7 +69,7 @@ Since -42 is in the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final res
                  ^ 
     The parsed integer is 4193.
 
-Since 4193 is in the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final result is 4193. 
+Since 4193 is in the range [-2<sup>31</sup>, 2<sup>31</sup> - 1], the final result is 4193. 
 
 **Example 4:**
 
@@ -87,7 +87,7 @@ Since 4193 is in the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final re
              ^
     The parsed integer is 0 because no digits were read.
 
-Since 0 is in the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final result is 0. 
+Since 0 is in the range [-2<sup>31</sup>, 2<sup>31</sup> - 1], the final result is 0. 
 
 **Example 5:**
 
@@ -105,7 +105,7 @@ Since 0 is in the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final resul
                          ^
     The parsed integer is -91283472332.
 
-Since -91283472332 is less than the lower bound of the range \[-2<sup>31</sup>, 2<sup>31</sup> - 1\], the final result is clamped to -2<sup>31</sup> = -2147483648.  
+Since -91283472332 is less than the lower bound of the range [-2<sup>31</sup>, 2<sup>31</sup> - 1], the final result is clamped to -2<sup>31</sup> = -2147483648.  
 
 **Constraints:**
 

src.save/main/java/g0001_0100/s0011_container_with_most_water/readme.md

@@ -10,27 +10,27 @@ Given `n` non-negative integers <code>a<sub>1</sub>, a<sub>2</sub>, ..., a<sub>n
 
 ![](https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg)
 
-**Input:** height = \[1,8,6,2,5,4,8,3,7\]
+**Input:** height = [1,8,6,2,5,4,8,3,7]
 
 **Output:** 49
 
-**Explanation:** The above vertical lines are represented by array \[1,8,6,2,5,4,8,3,7\]. In this case, the max area of water (blue section) the container can contain is 49. 
+**Explanation:** The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49. 
 
 **Example 2:**
 
-**Input:** height = \[1,1\]
+**Input:** height = [1,1]
 
 **Output:** 1 
 
 **Example 3:**
 
-**Input:** height = \[4,3,2,1,4\]
+**Input:** height = [4,3,2,1,4]
 
 **Output:** 16 
 
 **Example 4:**
 
-**Input:** height = \[1,2,1\]
+**Input:** height = [1,2,1]
 
 **Output:** 2 
 

src.save/main/java/g0001_0100/s0014_longest_common_prefix/readme.md

@@ -8,13 +8,13 @@ If there is no common prefix, return an empty string `""`.
 
 **Example 1:**
 
-**Input:** strs = \["flower","flow","flight"\]
+**Input:** strs = ["flower","flow","flight"]
 
 **Output:** "fl" 
 
 **Example 2:**
 
-**Input:** strs = \["dog","racecar","car"\]
+**Input:** strs = ["dog","racecar","car"]
 
 **Output:** ""
 

src.save/main/java/g0001_0100/s0015_3sum/readme.md

@@ -8,21 +8,21 @@ Notice that the solution set must not contain duplicate triplets.
 
 **Example 1:**
 
-**Input:** nums = \[-1,0,1,2,-1,-4\]
+**Input:** nums = [-1,0,1,2,-1,-4]
 
-**Output:** \[\[-1,-1,2\],\[-1,0,1\]\] 
+**Output:** [[-1,-1,2],[-1,0,1]] 
 
 **Example 2:**
 
-**Input:** nums = \[\]
+**Input:** nums = []
 
-**Output:** \[\] 
+**Output:** [] 
 
 **Example 3:**
 
-**Input:** nums = \[0\]
+**Input:** nums = [0]
 
-**Output:** \[\] 
+**Output:** [] 
 
 **Constraints:**
 

src.save/main/java/g0001_0100/s0016_3sum_closest/readme.md

@@ -10,15 +10,15 @@ You may assume that each input would have exactly one solution.
 
 **Example 1:**
 
-**Input:** nums = \[-1,2,1,-4\], target = 1
+**Input:** nums = [-1,2,1,-4], target = 1
 
 **Output:** 2
 
 **Explanation:** The sum that is closest to the target is 2. (-1 + 2 + 1 = 2). 
 
 **Example 2:**
 
-**Input:** nums = \[0,0,0\], target = 1
+**Input:** nums = [0,0,0], target = 1
 
 **Output:** 0 
 

src.save/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/readme.md

@@ -12,19 +12,19 @@ A mapping of digit to letters (just like on the telephone buttons) is given belo
 
 **Input:** digits = "23"
 
-**Output:** \["ad","ae","af","bd","be","bf","cd","ce","cf"\] 
+**Output:** ["ad","ae","af","bd","be","bf","cd","ce","cf"] 
 
 **Example 2:**
 
 **Input:** digits = ""
 
-**Output:** \[\] 
+**Output:** [] 
 
 **Example 3:**
 
 **Input:** digits = "2"
 
-**Output:** \["a","b","c"\] 
+**Output:** ["a","b","c"] 
 
 **Constraints:**
 

src.save/main/java/g0001_0100/s0018_4sum/readme.md

@@ -12,15 +12,15 @@ You may return the answer in **any order**.
 
 **Example 1:**
 
-**Input:** nums = \[1,0,-1,0,-2,2\], target = 0
+**Input:** nums = [1,0,-1,0,-2,2], target = 0
 
-**Output:** \[\[-2,-1,1,2\],\[-2,0,0,2\],\[-1,0,0,1\]\] 
+**Output:** [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]] 
 
 **Example 2:**
 
-**Input:** nums = \[2,2,2,2,2\], target = 8
+**Input:** nums = [2,2,2,2,2], target = 8
 
-**Output:** \[\[2,2,2,2\]\] 
+**Output:** [[2,2,2,2]] 
 
 **Constraints:**