Fixed readme files.

Author: javadev

Diff for: 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:**
 

Diff for: 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:**
 

Diff for: 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:**
 

Diff for: 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:**
 

Diff for: 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:**
 

Diff for: 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:**
 

Diff for: 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:**
 

Diff for: 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
 

Diff for: 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
 

Diff for: 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.
 

Diff for: src/main/java/g1801_1900/s1829_maximum_xor_for_each_query/readme.md

@@ -15,7 +15,7 @@ Return _an array_ `answer`_, where_ `answer[i]` _is the answer to the_ <code>i<s
 
 **Output:** [0,3,2,3]
 
-**Explanation:**: The queries are answered as follows: 
+**Explanation:** The queries are answered as follows: 
 
 1<sup>st</sup> query: nums = [0,1,1,3], k = 0 since 0 XOR 1 XOR 1 XOR 3 XOR 0 = 3. 
 
@@ -31,7 +31,7 @@ Return _an array_ `answer`_, where_ `answer[i]` _is the answer to the_ <code>i<s
 
 **Output:** [5,2,6,5]
 
-**Explanation:**: The queries are answered as follows: 
+**Explanation:** The queries are answered as follows: 
 
 1<sup>st</sup> query: nums = [2,3,4,7], k = 5 since 2 XOR 3 XOR 4 XOR 7 XOR 5 = 7. 
 

Diff for: src/main/java/g1801_1900/s1888_minimum_number_of_flips_to_make_the_binary_string_alternating/readme.md

@@ -19,7 +19,7 @@ The string is called **alternating** if no two adjacent characters are equal.
 
 **Output:** 2
 
-**Explanation:**: Use the first operation two times to make s = "100011".
+**Explanation:** Use the first operation two times to make s = "100011".
 
 Then, use the second operation on the third and sixth elements to make s = "101010".
 
@@ -29,15 +29,15 @@ Then, use the second operation on the third and sixth elements to make s = "1010
 
 **Output:** 0
 
-**Explanation:**: The string is already alternating.
+**Explanation:** The string is already alternating.
 
 **Example 3:**
 
 **Input:** s = "1110"
 
 **Output:** 1
 
-**Explanation:**: Use the second operation on the second element to make s = "1010".
+**Explanation:** Use the second operation on the second element to make s = "1010".
 
 **Constraints:**
 

Diff for: src/main/java/g1801_1900/s1889_minimum_space_wasted_from_packaging/readme.md

@@ -18,7 +18,7 @@ Return _the **minimum total wasted space** by choosing the box supplier **optima
 
 **Output:** 6
 
-**Explanation:**: It is optimal to choose the first supplier, using two size-4 boxes and one size-8 box.
+**Explanation:** It is optimal to choose the first supplier, using two size-4 boxes and one size-8 box.
 
 The total waste is (4-2) + (4-3) + (8-5) = 6. 
 

Diff for: src/main/java/g1801_1900/s1898_maximum_number_of_removable_characters/readme.md

@@ -16,7 +16,7 @@ A **subsequence** of a string is a new string generated from the original string
 
 **Output:** 2
 
-**Explanation:**: After removing the characters at indices 3 and 1, "a**b**c**a**cb" becomes "accb".
+**Explanation:** After removing the characters at indices 3 and 1, "a**b**c**a**cb" becomes "accb".
 
 "ab" is a subsequence of "**a**cc**b**".
 
@@ -30,7 +30,7 @@ Hence, the maximum k is 2.
 
 **Output:** 1
 
-**Explanation:**: After removing the character at index 3, "abc**b**ddddd" becomes "abcddddd".
+**Explanation:** After removing the character at index 3, "abc**b**ddddd" becomes "abcddddd".
 
 "abcd" is a subsequence of "**abcd**dddd".
 
@@ -40,7 +40,7 @@ Hence, the maximum k is 2.
 
 **Output:** 0
 
-**Explanation:**: If you remove the first index in the array removable, "abc" is no longer a subsequence.
+**Explanation:** If you remove the first index in the array removable, "abc" is no longer a subsequence.
 
 **Constraints:**
 

Diff for: src/main/java/g1901_2000/s1910_remove_all_occurrences_of_a_substring/readme.md

@@ -16,7 +16,7 @@ A **substring** is a contiguous sequence of characters in a string.
 
 **Output:** "dab"
 
-**Explanation:**: The following operations are done: 
+**Explanation:** The following operations are done: 
 
 - s = "da**abc**baabcbc", remove "abc" starting at index 2, so s = "dabaabcbc". 
 
@@ -30,7 +30,7 @@ A **substring** is a contiguous sequence of characters in a string.
 
 **Output:** "ab"
 
-**Explanation:**: The following operations are done: 
+**Explanation:** The following operations are done: 
 
 - s = "axxx**xy**yyyb", remove "xy" starting at index 4 so s = "axxxyyyb".
 

Diff for: src/main/java/g1901_2000/s1925_count_square_sum_triples/readme.md

@@ -12,15 +12,15 @@ Given an integer `n`, return _the number of **square triples** such that_ `1 <=
 
 **Output:** 2
 
-**Explanation:**: The square triples are (3,4,5) and (4,3,5).
+**Explanation:** The square triples are (3,4,5) and (4,3,5).
 
 **Example 2:**
 
 **Input:** n = 10
 
 **Output:** 4
 
-**Explanation:**: The square triples are (3,4,5), (4,3,5), (6,8,10), and (8,6,10).
+**Explanation:** The square triples are (3,4,5), (4,3,5), (6,8,10), and (8,6,10).
 
 **Constraints:**
 

Diff for: src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/readme.md

@@ -16,7 +16,7 @@ A **subsequence** is a string that can be derived from another string by deletin
 
 **Output:** 9
 
-**Explanation:**: An optimal solution is to choose "ete" for the 1<sup>st</sup> subsequence and "cdc" for the 2<sup>nd</sup> subsequence.
+**Explanation:** An optimal solution is to choose "ete" for the 1<sup>st</sup> subsequence and "cdc" for the 2<sup>nd</sup> subsequence.
 
 The product of their lengths is: 3 \* 3 = 9. 
 
@@ -26,7 +26,7 @@ The product of their lengths is: 3 \* 3 = 9.
 
 **Output:** 1
 
-**Explanation:**: An optimal solution is to choose "b" (the first character) for the 1<sup>st</sup> subsequence and "b" (the second character) for the 2<sup>nd</sup> subsequence.
+**Explanation:** An optimal solution is to choose "b" (the first character) for the 1<sup>st</sup> subsequence and "b" (the second character) for the 2<sup>nd</sup> subsequence.
 
 The product of their lengths is: 1 \* 1 = 1. 
 
@@ -36,7 +36,7 @@ The product of their lengths is: 1 \* 1 = 1.
 
 **Output:** 25
 
-**Explanation:**: An optimal solution is to choose "accca" for the 1<sup>st</sup> subsequence and "xxcxx" for the 2<sup>nd</sup> subsequence.
+**Explanation:** An optimal solution is to choose "accca" for the 1<sup>st</sup> subsequence and "xxcxx" for the 2<sup>nd</sup> subsequence.
 
 The product of their lengths is: 5 \* 5 = 25.