Practice Find Valid Matrix Given Row and Column Sums
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Find Valid Matrix Given Row and Column Sums on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
rowSum = [3,8], colSum = [4,7]
[[3,0], [1,7]]
# Example 2
rowSum = [5,7,10], colSum = [8,6,8]
[[0,5,0], [6,1,0], [2,0,8]]
Constraints
Related LeetCode Problems
Practice more problems similar to Find Valid Matrix Given Row and Column Sums.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.