Improved task 2836

Author: javadev

src/main/java/g2801_2900/s2836_maximize_value_of_function_in_a_ball_passing_game/readme.md

@@ -18,47 +18,13 @@ Return _an integer denoting the **maximum** value of the function._
 
 **Example 1:**
 
-Pass Number
-
-Sender ID
-
-Receiver ID
-
-x + Receiver IDs
-
-2
-
-1
-
-2
-
-1
-
-3
-
-2
-
-1
-
-0
-
-3
-
-3
-
-0
-
-2
-
-5
-
-4
-
-2
-
-1
-
-6
+| Pass Number | Sender ID | Receiver ID | x + Receiver IDs
+|-------------|-----------|-------------|-----------------
+| <!-- --> | <!-- --> | <!-- --> | 2
+| 1 | 2 | 1 | 3
+| 2 | 1 | 0 | 3
+| 3 | 0 | 2 | 5
+| 4 | 2 | 1 | 6
 
 **Input:** receiver = [2,0,1], k = 4
 
@@ -68,39 +34,12 @@ x + Receiver IDs
 
 **Example 2:**
 
-Pass Number
-
-Sender ID
-
-Receiver ID
-
-x + Receiver IDs
-
-4
-
-1
-
-4
-
-3
-
-7
-
-2
-
-3
-
-2
-
-9
-
-3
-
-2
-
-1
-
-10
+| Pass Number | Sender ID | Receiver ID | x + Receiver IDs
+|-------------|-----------|-------------|-----------------
+| <!-- --> | <!-- --> | <!-- --> | 4
+| 1 | 4 | 3 | 7
+| 2 | 3 | 2 | 9
+| 3 | 2 | 1 | 10
 
 **Input:** receiver = [1,1,1,2,3], k = 3
 
@@ -112,4 +51,4 @@ x + Receiver IDs
 
 *   <code>1 <= receiver.length == n <= 10<sup>5</sup></code>
 *   `0 <= receiver[i] <= n - 1`
-*   <code>1 <= k <= 10<sup>10</sup></code>
+*   <code>1 <= k <= 10<sup>10</sup></code>