Easyy-Peasyy Java Soln. || Makes you think Intuitively.
\uD83D\uDCBB Code\njava []\nclass Solution {\n    public long maxMatrixSum(int[][] matrix) {\n        int n = matrix.length;\n        int cnt = 0;\n        long
# \uD83D\uDCBB Code\n```java []\nclass Solution {\n    public long maxMatrixSum(int[][] matrix) {\n        int n = matrix.length;\n        int cnt = 0;\n        long mini = Long.MAX_VALUE, sum = 0;\n\n        for (int i = 0; i < n; i++) {\n            for (int j = 0; j < n; j++) {\n                if (matrix[i][j] < 0) {\n                    cnt++;\n                }\n                mini = Math.min(mini, Math.abs(matrix[i][j]));\n                sum += Math.abs(matrix[i][j]);\n            }\n        }\n\n        if (cnt % 2 == 0) return sum;\n        return sum -= (2 * mini);\n    }\n}\n```
['Array', 'Greedy', 'Matrix', 'Java']