Update readme.md

javadev · web-flow · commit a4120c333010 · 2021-11-27T01:09:28.000+02:00
diff --git a/src/main/java/g0201_0300/s0268_missing_number/readme.md b/src/main/java/g0201_0300/s0268_missing_number/readme.md
@@ -26,15 +26,15 @@ Given an array `nums` containing `n` distinct numbers in the range `[0, n]`, ret
 
 **Output:** 8
 
-**Explanation:****:** n = 9 since there are 9 numbers, so all numbers are in the range \[0,9\]. 8 is the missing number in the range since it does not appear in nums. 
+**Explanation:** n = 9 since there are 9 numbers, so all numbers are in the range \[0,9\]. 8 is the missing number in the range since it does not appear in nums. 
 
 **Example 4:**
 
 **Input:** nums = \[0\]
 
 **Output:** 1
 
-**Explanation:****:** n = 1 since there is 1 number, so all numbers are in the range \[0,1\]. 1 is the missing number in the range since it does not appear in nums. 
+**Explanation:** n = 1 since there is 1 number, so all numbers are in the range \[0,1\]. 1 is the missing number in the range since it does not appear in nums. 
 
 **Constraints:**
 
@@ -43,4 +43,4 @@ Given an array `nums` containing `n` distinct numbers in the range `[0, n]`, ret
 *   `0 <= nums[i] <= n`
 *   All the numbers of `nums` are **unique**.
 
-**Follow up:** Could you implement a solution using only `O(1)` extra space complexity and `O(n)` runtime complexity?
+**Follow up:** Could you implement a solution using only `O(1)` extra space complexity and `O(n)` runtime complexity?
