20251101

src/inflearn_coding_test/basic/2-5_등수구하기.js

@@ -3,7 +3,6 @@ function solution(arr) {
 
   for (let i = 0; i < arr.length; i++) {
     for (let j = 0; j < arr.length; j++) {
-      if (i === j) continue;
       if (arr[i] < arr[j]) answer[i]++;
     }
   }

src/inflearn_coding_test/basic/2-6_격자판최대합.js

@@ -0,0 +1,35 @@
+function solution(arr) {
+  const n = arr.length;
+  let sum1 = 0;
+  let sum2 = 0;
+  let answer = Number.MIN_SAFE_INTEGER;
+
+  for (let i = 0; i < n; i++) {
+    sum1 = sum2 = 0;
+
+    for (let j = 0; j < n; j++) {
+      sum1 += arr[i][j];
+      sum2 += arr[j][i];
+    }
+    answer = Math.max(answer, sum1, sum2);
+  }
+
+  sum1 = sum2 = 0;
+  for (let i = 0; i < n; i++) {
+    sum1 += arr[i][i];
+    sum2 += arr[i][n - i - 1];
+  }
+
+  answer = Math.max(answer, sum1, sum2);
+  return answer;
+}
+
+console.log(
+  solution([
+    [10, 13, 10, 12, 15],
+    [12, 39, 30, 23, 11],
+    [11, 25, 50, 53, 15],
+    [19, 27, 29, 37, 27],
+    [19, 13, 30, 13, 19],
+  ]),
+);