...
The K Weakest Rows in a Matrix
Try to solve The K Weakest Rows in a Matrix problem.
You are given an m×nm \times nm×n binary matrix of 111’s (representing soldiers) and 000’s (representing civilians). The soldiers are positioned in front of the civilians, i.e., all the 111’s will appear to the left of ...