Available question text
Given an m×n zero matrix and a list of indices where each (r,c) increments all cells in row r and column c, determine how many cells are odd after all operations. Key idea: track parity of row/column increments (O(m+n+indices.length) time, O(m+n) space); number of odd cells = odd_rows*(n-odd_cols) + (m-odd_rows)*odd_cols.
Related questions
Continue with questions that share topics or the same question type.
- Largest Local Values in a Matrix
Coding
- Matrix Cells in Distance Order
Coding
- Maximum Strictly Increasing Cells in a Matrix
Coding
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1252. Cells with Odd Values in a Matrix
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source