Coding - Leftmost Column with At Least a One

Problem Statement

Given a binary matrix binaryMatrix, find the leftmost column with at least one 1. If no such column exists, return -1.

Examples

1. Example 1: plaintext Input: binaryMatrix = [ [0,0,0,1], [0,0,1,1], [1,1,0,1] ] Output: 1 The first column has an element 1 at row 2 and row 3.

2. Example 2: plaintext Input: binaryMatrix = [ [0,0,0,0], [0,0,0,1], [0,0,1,1] ] Output: 1 The first column has an element 1 at row 2 and row 3.

3. Example 3: plaintext Input: binaryMatrix = [ [0,0,0,0], [0,0,0,0], [0,0,0,0] ] Output: -1 There is no column which contains a 1.

Constraints

• m == binaryMatrix.length
• n == binaryMatrix[i].length
• 1 <= m, n <= 100
• binaryMatrix[i][j] is either 0 or 1

Hints

• This problem can be solved using a binary search approach.
• Since each row is sorted in non-decreasing order, we can optimize the search process.

NOT_FOUND