2022-09-01 update: added "Largest Local Values in a Matrix" (#79)

Author: fartem

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/LargestLocalValuesInAMatrix.java

@@ -0,0 +1,33 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+// https://leetcode.com/problems/largest-local-values-in-a-matrix/
+public class LargestLocalValuesInAMatrix {
+
+    private final int[][] input;
+
+    public LargestLocalValuesInAMatrix(int[][] input) {
+        this.input = input;
+    }
+
+    public int[][] solution() {
+        int n = input.length;
+        int[][] result = new int[n - 2][n - 2];
+        for (int i = 0; i < n - 2; i++) {
+            for (int j = 0; j < n - 2; j++) {
+                result[i][j] = highest(input, i, j);
+            }
+        }
+        return result;
+    }
+
+    private int highest(int[][] grid, int r, int c) {
+        int max = 0;
+        for (int i = r; i < r + 3; i++) {
+            for (int j = c; j < c + 3; j++) {
+                max = Math.max(max, grid[i][j]);
+            }
+        }
+        return max;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/easy/LargestLocalValuesInAMatrixTest.java

@@ -0,0 +1,23 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+import static org.junit.Assert.assertEquals;
+
+public class LargestLocalValuesInAMatrixTest {
+
+    @Test
+    public void defaultTest() {
+        int[][] correct = new int[][]{{9, 9}, {8, 6}};
+        int[][] solution = new LargestLocalValuesInAMatrix(
+                new int[][]{{9, 9, 8, 1}, {5, 6, 2, 6}, {8, 2, 6, 4}, {6, 2, 2, 2}}
+        ).solution();
+        assertEquals(correct.length, solution.length);
+        assertEquals(correct[0].length, solution[0].length);
+        for (int i = 0; i < correct.length; i++) {
+            assertArrayEquals(correct[i], solution[i]);
+        }
+    }
+
+}