Fixed readme files.

Author: javadev

src/main/java/g0601_0700/s0657_robot_return_to_origin/readme.md

@@ -16,15 +16,15 @@ Return `true` _if the robot returns to the origin after it finishes all of its m
 
 **Output:** true
 
-**Explanation:**: The robot moves up once, and then down once. All moves have the same magnitude, so it ended up at the origin where it started. Therefore, we return true. 
+**Explanation:** The robot moves up once, and then down once. All moves have the same magnitude, so it ended up at the origin where it started. Therefore, we return true. 
 
 **Example 2:**
 
 **Input:** moves = "LL"
 
 **Output:** false
 
-**Explanation:**: The robot moves left twice. It ends up two "moves" to the left of the origin. We return false because it is not at the origin at the end of its moves. 
+**Explanation:** The robot moves left twice. It ends up two "moves" to the left of the origin. We return false because it is not at the origin at the end of its moves. 
 
 **Constraints:**
 

src/main/java/g0801_0900/s0873_length_of_longest_fibonacci_subsequence/readme.md

@@ -25,7 +25,7 @@ A **subsequence** is derived from another sequence `arr` by deleting any number
 
 **Output:** 3
 
-**Explanation:**: The longest subsequence that is fibonacci-like: [1,11,12], [3,11,14] or [7,11,18].
+**Explanation:** The longest subsequence that is fibonacci-like: [1,11,12], [3,11,14] or [7,11,18].
 
 **Constraints:**
 

src/main/java/g0901_1000/s0906_super_palindromes/readme.md

@@ -12,7 +12,7 @@ Given two positive integers `left` and `right` represented as strings, return _t
 
 **Output:** 4
 
-**Explanation:**: 4, 9, 121, and 484 are superpalindromes. Note that 676 is not a superpalindrome: 26 \* 26 = 676, but 26 is not a palindrome.
+**Explanation:** 4, 9, 121, and 484 are superpalindromes. Note that 676 is not a superpalindrome: 26 \* 26 = 676, but 26 is not a palindrome.
 
 **Example 2:**
 

src/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/readme.md

@@ -15,15 +15,15 @@ Return `true` if and only if you can choose `X >= 2` such that it is possible to
 
 **Output:** true
 
-**Explanation:**: Possible partition [1,1],[2,2],[3,3],[4,4].
+**Explanation:** Possible partition [1,1],[2,2],[3,3],[4,4].
 
 **Example 2:**
 
 **Input:** deck = [1,1,1,2,2,2,3,3]
 
 **Output:** false
 
-**Explanation:**: No possible partition.
+**Explanation:** No possible partition.
 
 **Constraints:**
 

src/main/java/g1301_1400/s1331_rank_transform_of_an_array/readme.md

@@ -16,15 +16,15 @@ The rank represents how large the element is. The rank has the following rules:
 
 **Output:** [4,1,2,3]
 
-**Explanation:**: 40 is the largest element. 10 is the smallest. 20 is the second smallest. 30 is the third smallest.
+**Explanation:** 40 is the largest element. 10 is the smallest. 20 is the second smallest. 30 is the third smallest.
 
 **Example 2:**
 
 **Input:** arr = [100,100,100]
 
 **Output:** [1,1,1]
 
-**Explanation:**: Same elements share the same rank.
+**Explanation:** Same elements share the same rank.
 
 **Example 3:**
 

src/main/java/g1401_1500/s1481_least_number_of_unique_integers_after_k_removals/readme.md

@@ -10,15 +10,15 @@ Given an array of integers `arr` and an integer `k`. Find the _least number of u
 
 **Output:** 1
 
-**Explanation:**: Remove the single 4, only 5 is left.
+**Explanation:** Remove the single 4, only 5 is left.
 
 **Example 2:**
 
 **Input:** arr = [4,3,1,1,3,3,2], k = 3
 
 **Output:** 2
 
-**Explanation:**: Remove 4, 2 and either one of the two 1s or three 3s. 1 and 3 will be left.
+**Explanation:** Remove 4, 2 and either one of the two 1s or three 3s. 1 and 3 will be left.
 
 **Constraints:**
 

src/main/java/g1501_1600/s1593_split_a_string_into_the_max_number_of_unique_substrings/readme.md

@@ -14,23 +14,23 @@ A **substring** is a contiguous sequence of characters within a string.
 
 **Output:** 5
 
-**Explanation:**: One way to split maximally is ['a', 'b', 'ab', 'c', 'cc']. Splitting like ['a', 'b', 'a', 'b', 'c', 'cc'] is not valid as you have 'a' and 'b' multiple times.
+**Explanation:** One way to split maximally is ['a', 'b', 'ab', 'c', 'cc']. Splitting like ['a', 'b', 'a', 'b', 'c', 'cc'] is not valid as you have 'a' and 'b' multiple times.
 
 **Example 2:**
 
 **Input:** s = "aba"
 
 **Output:** 2
 
-**Explanation:**: One way to split maximally is ['a', 'ba'].
+**Explanation:** One way to split maximally is ['a', 'ba'].
 
 **Example 3:**
 
 **Input:** s = "aa"
 
 **Output:** 1
 
-**Explanation:**: It is impossible to split the string any further.
+**Explanation:** It is impossible to split the string any further.
 
 **Constraints:**
 

src/main/java/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/readme.md

@@ -16,7 +16,7 @@ Return _the minimum cost it takes to connect the two groups_.
 
 **Output:** 17
 
-**Explanation:**: The optimal way of connecting the groups is:
+**Explanation:** The optimal way of connecting the groups is:
 
 1--A
 
@@ -32,7 +32,7 @@ This results in a total cost of 17.
 
 **Output:** 4
 
-**Explanation:**: The optimal way of connecting the groups is:
+**Explanation:** The optimal way of connecting the groups is:
 
 1--A
 

src/main/java/g1601_1700/s1672_richest_customer_wealth/readme.md

@@ -26,7 +26,7 @@ Both customers are considered the richest with a wealth of 6 each, so return 6.
 
 **Output:** 10
 
-**Explanation:**:
+**Explanation:**
 
 1st customer has wealth = 6
 

src/main/java/g1601_1700/s1680_concatenation_of_consecutive_binary_numbers/readme.md

@@ -28,7 +28,7 @@ After concatenating them, we have "11011", which corresponds to the decimal valu
 
 **Output:** 505379714
 
-**Explanation:**: The concatenation results in "1101110010111011110001001101010111100".
+**Explanation:** The concatenation results in "1101110010111011110001001101010111100".
 
 The decimal value of that is 118505380540.