feat: add ts solution to lc problem: No.1727 (#2019)

Author: iam-abhishek-yadav

solution/1700-1799/1727.Largest Submatrix With Rearrangements/README.md

@@ -173,6 +173,47 @@ func largestSubmatrix(matrix [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function largestSubmatrix(matrix: number[][]): number {
+    for (let column = 0; column < matrix[0].length; column++) {
+        for (let row = 0; row < matrix.length; row++) {
+            let tempRow = row;
+            let count = 0;
+
+            while (tempRow < matrix.length && matrix[tempRow][column] === 1) {
+                count++;
+                tempRow++;
+            }
+
+            while (count !== 0) {
+                matrix[row][column] = count;
+                count--;
+                row++;
+            }
+        }
+    }
+
+    for (let row = 0; row < matrix.length; row++) {
+        matrix[row].sort((a, b) => a - b);
+    }
+
+    let maxSubmatrixArea = 0;
+
+    for (let row = 0; row < matrix.length; row++) {
+        for (let col = matrix[row].length - 1; col >= 0; col--) {
+            maxSubmatrixArea = Math.max(
+                maxSubmatrixArea,
+                matrix[row][col] * (matrix[row].length - col),
+            );
+        }
+    }
+
+    return maxSubmatrixArea;
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1727.Largest Submatrix With Rearrangements/README_EN.md

@@ -141,6 +141,47 @@ func largestSubmatrix(matrix [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function largestSubmatrix(matrix: number[][]): number {
+    for (let column = 0; column < matrix[0].length; column++) {
+        for (let row = 0; row < matrix.length; row++) {
+            let tempRow = row;
+            let count = 0;
+
+            while (tempRow < matrix.length && matrix[tempRow][column] === 1) {
+                count++;
+                tempRow++;
+            }
+
+            while (count !== 0) {
+                matrix[row][column] = count;
+                count--;
+                row++;
+            }
+        }
+    }
+
+    for (let row = 0; row < matrix.length; row++) {
+        matrix[row].sort((a, b) => a - b);
+    }
+
+    let maxSubmatrixArea = 0;
+
+    for (let row = 0; row < matrix.length; row++) {
+        for (let col = matrix[row].length - 1; col >= 0; col--) {
+            maxSubmatrixArea = Math.max(
+                maxSubmatrixArea,
+                matrix[row][col] * (matrix[row].length - col),
+            );
+        }
+    }
+
+    return maxSubmatrixArea;
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1727.Largest Submatrix With Rearrangements/Solution.ts

@@ -0,0 +1,36 @@
+function largestSubmatrix(matrix: number[][]): number {
+    for (let column = 0; column < matrix[0].length; column++) {
+        for (let row = 0; row < matrix.length; row++) {
+            let tempRow = row;
+            let count = 0;
+
+            while (tempRow < matrix.length && matrix[tempRow][column] === 1) {
+                count++;
+                tempRow++;
+            }
+
+            while (count !== 0) {
+                matrix[row][column] = count;
+                count--;
+                row++;
+            }
+        }
+    }
+
+    for (let row = 0; row < matrix.length; row++) {
+        matrix[row].sort((a, b) => a - b);
+    }
+
+    let maxSubmatrixArea = 0;
+
+    for (let row = 0; row < matrix.length; row++) {
+        for (let col = matrix[row].length - 1; col >= 0; col--) {
+            maxSubmatrixArea = Math.max(
+                maxSubmatrixArea,
+                matrix[row][col] * (matrix[row].length - col),
+            );
+        }
+    }
+
+    return maxSubmatrixArea;
+}