From 0af6e982128f109deb9dd184906588dfbcde8583 Mon Sep 17 00:00:00 2001
From: Jinyoung Jeong <80400463+jyoung2419@users.noreply.github.com>
Date: Sat, 12 Sep 2026 16:27:10 +0900
Subject: [PATCH] Add diagonalSort function for matrix sorting

Implement diagonal sorting for a matrix.
---
 .../1329. Sort the Matrix Diagonally"         | 62 +++++++++++++++++++
 1 file changed, 62 insertions(+)
 create mode 100644 "leetcode3/\354\240\225\354\247\204\354\230\201/1329. Sort the Matrix Diagonally"

diff --git "a/leetcode3/\354\240\225\354\247\204\354\230\201/1329. Sort the Matrix Diagonally" "b/leetcode3/\354\240\225\354\247\204\354\230\201/1329. Sort the Matrix Diagonally"
new file mode 100644
index 00000000..07d72291
--- /dev/null
+++ "b/leetcode3/\354\240\225\354\247\204\354\230\201/1329. Sort the Matrix Diagonally"	
@@ -0,0 +1,62 @@
+/**
+ * @param {number[][]} mat
+ * @return {number[][]}
+ */
+var diagonalSort = function(mat) {
+    const m = mat.length;
+    const n = mat[0].length;
+
+    for (let i = 0; i<m; i++){ // (i, 0)
+        let x = i;
+        let y = 0;
+
+        let arr = [];
+
+        while (x < m && y < n){
+            arr.push(mat[x][y]);
+
+            x++;
+            y++;
+        }
+
+        arr.sort((a, b) => a-b);
+
+        x = i;
+        y = 0;
+
+        for (let k = 0; k < arr.length; k++) {
+            mat[x][y] = arr[k];
+
+            x++;
+            y++;
+        }
+    }
+
+  for (let j = 1; j < n; j++) {
+        let x = 0;
+        let y = j;
+
+        let arr = [];
+
+        while (x < m && y < n) {
+            arr.push(mat[x][y]);
+
+            x++;
+            y++;
+        }
+
+        arr.sort((a, b) => a - b);
+
+        x = 0;
+        y = j;
+
+        for (let k = 0; k < arr.length; k++) {
+            mat[x][y] = arr[k];
+
+            x++;
+            y++;
+        }
+    }
+
+    return mat;
+};