โ† Paytm questions

Search in row-wise sorted matrix

Filed under Paytm

Given a 2D matrix where each row is sorted in strictly increasing order, write an algorithm to efficiently search for a target value in O(log(m*n)) or O(log(m+n)) time complexity.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Paytm questions

Collected from public candidate posts and coding forums. Updated Nov 2026.