AppliedAIPrep logoAppliedAI/Prep
← Coding & DSA / 65
mediumGoogleMetaAmazon

Search a sorted 2D matrix (staircase search).

A row- and column-sorted matrix rewards one observation: start from a corner and kill an entire row or column each step. That turns an O(m*n) scan into O(m+n), and the choice of corner is not arbitrary.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

A row- and column-sorted matrix rewards one observation: start from a corner and kill an entire row or column each step. That turns an O(m*n) scan into O(m+n), and the choice of corner is not arbitrary.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
Next in this trackImplement a dropout layer (train and inference) from scratch.Next in this trackLongest Consecutive Sequence in O(n) with a hash set.Next in this trackValidate a Binary Search Tree.
DISCUSSION · 0

No comments yet — be the first to share your approach.