Leetcode 1337. The K Weakest Rows in a Matrix

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1337. The K Weakest Rows in a Matrix

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact