Available question text
Given a binary matrix where each row is sorted non-decreasing (all 0s before 1s) and you can only query entries via a provided API, find the leftmost column index that contains at least one 1 (or return -1 if none), optimizing for minimal queries/time. The key is to exploit the row-sorted property to avoid scanning the whole matrix.
Related questions
Continue with questions that share topics or the same question type.
- Escape the Spreading Fire
Coding · Array · Binary Search · Breadth-First Search
- Find the Safest Path in a Grid
Coding · Array · Binary Search · Breadth-First Search
- Search a 2D Matrix
Coding · Array · Binary Search · Matrix
- Search a 2D Matrix II
Coding · Array · Binary Search · Divide and Conquer
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Uber
Leetcode 1428. Leftmost Column with at Least a One
Reported Jun 23, 2026 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Uber
Leftmost Column with at Least a One
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 67.3. This is not an interview probability.
View source