Why Set Matrix Zeroes In Place in DSA C++?

The Big Idea

What if you could fix a huge grid's zeros without extra memory or slow repeated scans?

The Scenario

Imagine you have a large spreadsheet with numbers, and if any cell is zero, you want to make its entire row and column zero. Doing this by checking each cell and updating rows and columns manually is like erasing and rewriting parts of a huge paper again and again.

The Problem

Manually scanning the whole matrix multiple times wastes time and can cause mistakes like changing cells too early or missing some zeros. It's slow and confusing, especially when the matrix is big.

The Solution

This method cleverly uses the first row and first column of the matrix itself to remember which rows and columns need to be zeroed. So, it avoids extra space and only scans the matrix a few times, making the process fast and neat.

Before vs After

✗ Before

for (int i = 0; i < rows; i++) {
  for (int j = 0; j < cols; j++) {
    if (matrix[i][j] == 0) {
      // zero entire row and column immediately
    }
  }
}

✓ After

for (int i = 0; i < rows; i++) {
  for (int j = 0; j < cols; j++) {
    if (matrix[i][j] == 0) {
      matrix[i][0] = 0;
      matrix[0][j] = 0;
    }
  }
}

What It Enables

This technique lets you update large matrices efficiently without extra memory, making your programs faster and cleaner.

Real Life Example

In image processing, if a pixel is corrupted (zero), you might want to mask its entire row and column quickly to avoid errors in the final picture.

Key Takeaways

Manual zeroing is slow and error-prone.

Using the matrix itself as a marker saves space and time.

This method is efficient for large data grids.

Practice

1. What is the main goal of the Set Matrix Zeroes In Place problem?

easy

A. Sort each row of the matrix in ascending order.

B. Find the sum of all elements in the matrix.

C. Count the number of zero elements in the matrix.

D. Modify the matrix so that if an element is 0, its entire row and column become 0 without using extra space.

Solution

1. Step 1: Understand the problem requirement

   The problem requires changing the matrix so that any row or column containing a zero is set entirely to zero.

2. Step 2: Note the in-place constraint

   We must do this without using extra space for another matrix or large data structures.

3. Final Answer:

   Modify the matrix so that if an element is 0, its entire row and column become 0 without using extra space. -> Option D

4. Quick Check:

   In-place zeroing = Modify matrix rows and columns [OK]

Hint: Remember: zero means zero entire row and column in place [OK]

Common Mistakes:

• Using extra space like another matrix
• Only zeroing the element itself, not row and column
• Not handling the in-place requirement

2. Which of the following C++ code snippets correctly declares a 2D vector to represent a matrix for the Set Matrix Zeroes In Place problem?

easy

A. std::vector matrix(cols, std::vector<int>(rows));

B. std::vector<int> matrix(rows, cols);

C. std::vector matrix(rows, std::vector<int>(cols));

D. std::vector<int> matrix[rows][cols];

Solution

1. Step 1: Understand 2D vector declaration

   To create a matrix with 'rows' rows and 'cols' columns, use vector of vectors with inner vector size 'cols'.

2. Step 2: Check each option

   std::vector matrix(rows, std::vector<int>(cols)); correctly creates a vector of vectors with 'rows' outer vectors and 'cols' inner vectors each.

3. Final Answer:

   std::vector matrix(rows, std::vector<int>(cols)); -> Option C

4. Quick Check:

   Correct 2D vector syntax = std::vector matrix(rows, std::vector<int>(cols)); [OK]

Hint: Use vector of vectors with inner vector size as columns [OK]

Common Mistakes:

• Using single vector with two sizes incorrectly
• Swapping rows and columns in inner vector
• Using array syntax instead of vector

3. What will be the state of the matrix after running the following code snippet for Set Matrix Zeroes In Place?

std::vector matrix = {
  {1, 2, 3},
  {4, 0, 6},
  {7, 8, 9}
};
// Assume correct in-place zeroing function is called here
setZeroes(matrix);
// Print matrix

medium

A. [[1, 2, 3], [4, 0, 6], [7, 8, 9]]

B. [[1, 0, 3], [0, 0, 0], [7, 0, 9]]

C. [[0, 0, 0], [0, 0, 0], [0, 0, 0]]

D. [[1, 2, 3], [0, 0, 0], [7, 8, 9]]

Solution

1. Step 1: Identify zero positions

   The zero is at position (1,1) (second row, second column).

2. Step 2: Set entire row and column to zero

   Row 1 becomes [0,0,0], column 1 becomes zero in rows 0 and 2, so matrix becomes [[1,0,3],[0,0,0],[7,0,9]].

3. Final Answer:

   [[1, 0, 3], [0, 0, 0], [7, 0, 9]] -> Option B

4. Quick Check:

   Zero at (1,1) zeroes row 1 and column 1 [OK]

Hint: Zero row and column where zero found [OK]

Common Mistakes:

• Zeroing entire matrix instead of row and column
• Not zeroing column correctly
• Leaving original zero row unchanged

4. Consider this buggy code snippet for Set Matrix Zeroes In Place. What is the main error?

void setZeroes(std::vector& matrix) {
  int rows = matrix.size();
  int cols = matrix[0].size();
  for (int i = 0; i < rows; i++) {
    for (int j = 0; j < cols; j++) {
      if (matrix[i][j] == 0) {
        for (int k = 0; k < cols; k++) matrix[i][k] = 0;
        for (int k = 0; k < rows; k++) matrix[k][j] = 0;
      }
    }
  }
}

medium

A. Modifying matrix inside loops causes multiple zeroing and incorrect results.

B. The loops do not cover all rows and columns.

C. The function does not return the modified matrix.

D. The matrix size is not checked for empty input.

Solution

1. Step 1: Analyze modification during iteration

   The code sets zeros immediately when a zero is found, changing matrix during iteration.

2. Step 2: Understand side effects

   This causes new zeros to appear and cause more zeroing, leading to incorrect results.

3. Final Answer:

   Modifying matrix inside loops causes multiple zeroing and incorrect results. -> Option A

4. Quick Check:

   Immediate modification causes cascading zeroing [OK]

Hint: Mark zeros first, then modify matrix after loops [OK]

Common Mistakes:

• Changing matrix while scanning causes wrong zeroing
• Not using markers or flags to delay zeroing
• Ignoring empty matrix edge cases

5. Given a matrix with multiple zeros, how can you efficiently set matrix zeroes in place without extra space? Choose the best approach.

hard

A. Use first row and first column as markers to store zero flags, then update matrix accordingly.

B. Create a copy of the matrix and update zeros in the copy.

C. Use a hash map to store zero positions and then update matrix.

D. Iterate multiple times over the matrix zeroing rows and columns immediately when zero found.

Solution

1. Step 1: Use first row and column as markers

   Mark zeros found in first row and column to remember which rows and columns to zero later.

2. Step 2: Update matrix based on markers

   After marking, zero out rows and columns except first row and column, then handle first row and column separately.

3. Final Answer:

   Use first row and first column as markers to store zero flags, then update matrix accordingly. -> Option A

4. Quick Check:

   In-place marking with first row/column = Use first row and first column as markers to store zero flags, then update matrix accordingly. [OK]

Hint: Use matrix edges as flags to avoid extra space [OK]

Common Mistakes:

• Using extra space violating in-place rule
• Zeroing immediately causing cascading errors
• Not handling first row and column separately