Imroved readme files.

Author: javadev

src.save/main/java/g0401_0500/s0436_find_right_interval/readme.md

@@ -4,7 +4,7 @@ Medium
 
 You are given an array of `intervals`, where <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> and each <code>start<sub>i</sub></code> is **unique**.
 
-The **r****ight**** interval** for an interval `i` is an interval `j` such that <code>start<sub>j</sub></code><code> >= end<sub>i</sub></code> and <code>start<sub>j</sub></code> is **minimized**.
+The **right interval** for an interval `i` is an interval `j` such that <code>start<sub>j</sub></code><code> >= end<sub>i</sub></code> and <code>start<sub>j</sub></code> is **minimized**.
 
 Return _an array of **right interval** indices for each interval `i`_. If no **right interval** exists for interval `i`, then put `-1` at index `i`.
 

src.save/main/java/g0901_1000/s0948_bag_of_tokens/readme.md

@@ -19,7 +19,7 @@ Return _the largest possible **score** you can achieve after playing any number
 
 **Output:** 0
 
-**Explanation:****:** Playing the only token in the bag is impossible because you either have too little power or too little score.
+**Explanation:** Playing the only token in the bag is impossible because you either have too little power or too little score.
 
 **Example 2:**
 

src.save/main/java/g1801_1900/s1834_single_threaded_cpu/readme.md

@@ -43,7 +43,7 @@ Return _the order in which the CPU will process the tasks._
 
 **Output:** [4,3,2,0,1]
 
-**Explanation:****:** The events go as follows: 
+**Explanation:** The events go as follows: 
 
 - At time = 7, all the tasks become available. Available tasks = {0,1,2,3,4}. 
 

src/main/java/g1901_2000/s1938_maximum_genetic_difference_query/readme.md

@@ -2,7 +2,7 @@
 
 Hard
 
-There is a rooted tree consisting of `n` nodes numbered `0` to `n - 1`. Each node's number denotes its **unique genetic value** (i.e. the genetic value of node `x` is `x`). The **genetic difference** between two genetic values is defined as the **bitwise-****XOR** of their values. You are given the integer array `parents`, where `parents[i]` is the parent for node `i`. If node `x` is the **root** of the tree, then `parents[x] == -1`.
+There is a rooted tree consisting of `n` nodes numbered `0` to `n - 1`. Each node's number denotes its **unique genetic value** (i.e. the genetic value of node `x` is `x`). The **genetic difference** between two genetic values is defined as the **bitwise-XOR** of their values. You are given the integer array `parents`, where `parents[i]` is the parent for node `i`. If node `x` is the **root** of the tree, then `parents[x] == -1`.
 
 You are also given the array `queries` where <code>queries[i] = [node<sub>i</sub>, val<sub>i</sub>]</code>. For each query `i`, find the **maximum genetic difference** between <code>val<sub>i</sub></code> and <code>p<sub>i</sub></code>, where <code>p<sub>i</sub></code> is the genetic value of any node that is on the path between <code>node<sub>i</sub></code> and the root (including <code>node<sub>i</sub></code> and the root). More formally, you want to maximize <code>val<sub>i</sub> XOR p<sub>i</sub></code>.