The latest articles on Forem by Mardonbek (@mardon1dev). https://forem.com/mardon1dev https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1422802%2Fa7f430e8-06be-407c-bca4-5e1d44eeeab2.png https://forem.com/mardon1dev en Mardonbek Sat, 20 Jul 2024 15:40:49 +0000 https://forem.com/mardon1dev/find-valid-matrix-given-row-and-column-sums-1n2o https://forem.com/mardon1dev/find-valid-matrix-given-row-and-column-sums-1n2o <p>In this code, it is displayed how to restore matrix.<br> var restoreMatrix = function(rowSum, colSum) {<br> let m = rowSum.length;<br> let n = colSum.length;<br> let matrix = new Array(m).fill(0).map(() =&gt; new Array(n).fill(0));<br> for (let i = 0; i &lt; m; i++) {<br> for (let j = 0; j &lt; n; j++) {<br> matrix[i][j] = Math.min(rowSum[i], colSum[j]);<br> rowSum[i] -= matrix[i][j];<br> colSum[j] -= matrix[i][j];<br> }<br> }<br> return matrix;<br><br> };</p> Mardonbek Fri, 19 Jul 2024 07:01:33 +0000 https://forem.com/mardon1dev/lucky-numbers-in-a-matrix-33n2 https://forem.com/mardon1dev/lucky-numbers-in-a-matrix-33n2 <p>*<em>This code describes how to find a lucky number in a matrix. *</em></p> <p>const luckyNumber = (matrix)=&gt;{<br> let num = []<br> for (let i = 0; i &lt; matrix.length; i++) {<br> let arr = matrix[i];<br> let rowMax = Math.min(...arr);<br> let columnIndex = matrix[i].indexOf(rowMax);<br> let column = matrix.map((row) =&gt; row[columnIndex]);<br> let columnMax = Math.max(...column);<br> if (rowMax === columnMax) {<br> num.push(rowMax);<br> }<br> }<br> return num;<br> }</p> javascript leetcode coding