Add solution #1605

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,414 LeetCode solutions in JavaScript
+# 1,415 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1239,6 +1239,7 @@
 1601|[Maximum Number of Achievable Transfer Requests](./solutions/1601-maximum-number-of-achievable-transfer-requests.js)|Hard|
 1603|[Design Parking System](./solutions/1603-design-parking-system.js)|Easy|
 1604|[Alert Using Same Key-Card Three or More Times in a One Hour Period](./solutions/1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.js)|Medium|
+1605|[Find Valid Matrix Given Row and Column Sums](./solutions/1605-find-valid-matrix-given-row-and-column-sums.js)|Medium|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1605-find-valid-matrix-given-row-and-column-sums.js

@@ -0,0 +1,38 @@
+/**
+ * 1605. Find Valid Matrix Given Row and Column Sums
+ * https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/
+ * Difficulty: Medium
+ *
+ * You are given two arrays rowSum and colSum of non-negative integers where rowSum[i] is the sum
+ * of the elements in the ith row and colSum[j] is the sum of the elements of the jth column of a
+ * 2D matrix. In other words, you do not know the elements of the matrix, but you do know the sums
+ * of each row and column.
+ *
+ * Find any matrix of non-negative integers of size rowSum.length x colSum.length that satisfies
+ * the rowSum and colSum requirements.
+ *
+ * Return a 2D array representing any matrix that fulfills the requirements. It's guaranteed that
+ * at least one matrix that fulfills the requirements exists.
+ */
+
+/**
+ * @param {number[]} rowSum
+ * @param {number[]} colSum
+ * @return {number[][]}
+ */
+var restoreMatrix = function(rowSum, colSum) {
+  const rows = rowSum.length;
+  const cols = colSum.length;
+  const matrix = Array.from({ length: rows }, () => Array(cols).fill(0));
+
+  for (let i = 0; i < rows; i++) {
+    for (let j = 0; j < cols; j++) {
+      const value = Math.min(rowSum[i], colSum[j]);
+      matrix[i][j] = value;
+      rowSum[i] -= value;
+      colSum[j] -= value;
+    }
+  }
+
+  return matrix;
+};