Search⌘ K
AI Features

Solution: The K Weakest Rows in a Matrix

Solution: The K Weakest Rows in a Matrix asks you to rank rows in a binary matrix by soldier count, breaking ties by row index, and return the indexes of the k weakest rows.

Statement

You are given an m×nm \times n binary matrix of 11’s (representing soldiers) and 00’s (representing civilians). The soldiers are positioned in front of the civilians, i.e., all the  ...