Home/

...

/

Solution: The K Weakest Rows in a Matrix

Solution: The K Weakest Rows in a Matrix

Let’s solve the The K Weakest Rows in a Matrix problem using the Modified Binary Search pattern.

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 11’s will appear to the left of all the  ...

Access this course and 1400+ top-rated courses and projects.