Available question text
Given an m x n matrix sorted in non-increasing order both row- and column-wise, return the number of negative entries; exploit the matrix's monotonicity to skip blocks of non-negative values and achieve an O(m + n) scan.
Related questions
Continue with questions that share topics or the same question type.
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 1351. Count Negative Numbers in a Sorted Matrix
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source