add 2500

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -43,6 +43,7 @@
 | 2520 | [Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2520.java)                                       | [:tv:](https://youtu.be/7SHHsS5kPJ8) | Easy                           ||
 | 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2515.java)                                       || Easy                                 ||
 | 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2506.java)                                       || Easy                                 ||
+| 2500 | [Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2500.java)                                       || Easy                                 ||
 | 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2496.java)                                       || Easy                                 ||
 | 2492 | [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2492.java)                                       || Medium                               | Union Find
 | 2490 | [Circular Sentence](https://leetcode.com/problems/circular-sentence/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2490.java)                                       || Easy                                 | 

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2500.java

@@ -0,0 +1,22 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.Arrays;
+
+public class _2500 {
+    public static class Solution1 {
+        public int deleteGreatestValue(int[][] grid) {
+            int sum = 0;
+            for (int i = 0; i < grid.length; i++) {
+                Arrays.sort(grid[i]);
+            }
+            for (int j = grid[0].length - 1; j >= 0; j--) {
+                int max = grid[0][j];
+                for (int i = 1; i < grid.length; i++) {
+                    max = Math.max(max, grid[i][j]);
+                }
+                sum += max;
+            }
+            return sum;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2500Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.thirdthousand._2500;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2500Test {
+    private static _2500.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2500.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(8, solution1.deleteGreatestValue(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2,4],[3,3,1]")));
+    }
+
+
+}