Available question text
Given an m×n binary matrix where each row's 1s appear before 0s, return the indices of the k weakest rows ordered by increasing number of soldiers (count of 1s), breaking ties by smaller row index.
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 1337. The K Weakest Rows in a Matrix
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source